Strong Converse for the Feedback-Assisted Classical Capacity of Entanglement-Breaking Channels
- 40 Downloads
Quantum entanglement can be used in a communication scheme to establish a correlation between successive channel inputs that is impossible by classical means. It is known that the classical capacity of quantum channels can be enhanced by such entangled encoding schemes, but this is not always the case. In this paper, we prove that a strong converse theorem holds for the classical capacity of an entanglement-breaking channel even when it is assisted by a classical feedback link from the receiver to the transmitter. In doing so, we identify a bound on the strong converse exponent, which determines the exponentially decaying rate at which the success probability tends to zero, for a sequence of codes with communication rate exceeding capacity. Proving a strong converse, along with an achievability theorem, shows that the classical capacity is a sharp boundary between reliable and unreliable communication regimes. One of the main tools in our proof is the sandwiched Rényi relative entropy. The same method of proof is used to derive an exponential bound on the success probability when communicating over an arbitrary quantum channel assisted by classical feedback, provided that the transmitter does not use entangled encoding schemes.
Unable to display preview. Download preview PDF.
- 27.Schumacher, B. and Westmoreland, M.D., Relative Entropy in Quantum Information Theory, Quantum Computation and Information (Proc. AMS Special Session, Jan. 19–21, 2000, Washington, DC), Lomonaco, S.J., Jr. and Brandt, H.E., Eds., Providence, RI: Amer. Math. Soc., 2002, pp. 265–290.Google Scholar
- 28.Holevo, A.S., Multiplicativity of p-Norms of Completely Positive Maps and the Additivity Problem in Quantum Information Theory, Uspekhi Mat. Nauk, 2006, vol. 61, no. 2 (368), pp. 113–152 [Russian Math. Surveys (Engl. Transl.), 2006, vol. 61, no. 2, pp. 301–339].MathSciNetCrossRefzbMATHGoogle Scholar
- 34.Polyanskiy, Y. and Verdú, S., Arimoto Channel Coding Converse and Rényi Divergence, in Proc. 48th Annual Allerton Conf. on Communication, Control, and Computation, Sept. 29–Oct. 1, 2010, Allerton, IL, USA, pp. 1327–1333.Google Scholar
- 36.Augustin, U., Noisy Channels, Habilitation Thesis, Univ. Erlangen-Nürnberg, Germany, 1978.Google Scholar