Classical Capacities of Averaged and Compound Quantum Channels

We determine the capacity of compound classical-quantum channels. As a consequence we obtain the capacity formula for the averaged classical-quantum channels. The capacity result for compound channels demonstrates, as in the classical setting, the existence of reliable universal classical-quantum codes in scenarios where the only a priori information about the channel used for the transmission of information is that it belongs to a given set of memoryless classical-quantum channels. Our approach is based on the universal classical approximation of the quantum relative entropy which in turn relies on the universal hypothesis testing results.

[1]  Rudolf Ahlswede,et al.  The weak capacity of averaged channels , 1968 .

[2]  Michael D. Westmoreland,et al.  Sending classical information via noisy quantum channels , 1997 .

[3]  M. Hayashi.  Optimal sequence of quantum measurements in the sense of Stein's lemma in quantum hypothesis testing , 2002, quant-ph/0208020.

[4]  M. Hayashi.  Asymptotics of quantum relative entropy from a representation theoretical viewpoint , 1997, quant-ph/9704040.

[5]  F. Hiai,et al.  The proper formula for relative entropy and its asymptotics in quantum probability , 1991 .

[6]  M. Fannes.  A continuity property of the entropy density for spin lattice systems , 1973 .

[7]  N. Datta,et al.  The coding theorem for a class of quantum channels with long-term memory , 2006, quant-ph/0610049.

[8]  Jacob Wolfowitz.  Coding Theorems of Information Theory , 1962 .

[9]  P. Shields.  The Ergodic Theory of Discrete Sample Paths , 1996 .

[10]  J. Deuschel,et al.  A Quantum Version of Sanov's Theorem , 2004, quant-ph/0412157.

[11]  Tomohiro Ogawa,et al.  Strong converse to the quantum channel coding theorem , 1999, IEEE Trans. Inf. Theory.

[12]  Tomohiro Ogawa,et al.  A New Proof of the Direct Part of Stein's Lemma in Quantum Hypothesis Testing , 2001 .

[13]  D. Blackwell,et al.  The Capacity of a Class of Channels , 1959 .

[14]  M. Donald.  Further results on the relative entropy , 1987, Mathematical Proceedings of the Cambridge Philosophical Society.

[15]  R. Ahlswede.  Certain results in coding theory for compound channels , 1967 .

[16]  Andreas J. Winter.  Coding theorems of quantum information theory , 1999 .

[17]  Alexander S. Holevo,et al.  The Capacity of the Quantum Channel with General Signal States , 1996, IEEE Trans. Inf. Theory.

[18]  M. Horodecki,et al.  Universal Quantum Information Compression , 1998, quant-ph/9805017.

[19]  M. Hastings.  Superadditivity of communication capacity using entangled inputs , 2009 .

[20]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[21]  Andreas J. Winter,et al.  Coding theorem and strong converse for quantum channels , 1999, IEEE Trans. Inf. Theory.