General formulas for capacity of classical-quantum channels

The capacity of a classical-quantum channel (or, in other words, the classical capacity of a quantum channel) is considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a channel. A capacity formula as well as a characterization of the strong converse property is given just in parallel with the corresponding classical results of Verdu-Han (1994) which are based on the so-called information-spectrum method. The general results are applied to the stationary memoryless case with or without cost constraint on inputs, whereby a deep relation between the channel coding theory and the hypothesis testing for two quantum states is elucidated.

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

[2]  Amiel Feinstein,et al.  A new basic theorem of information theory , 1954, Trans. IRE Prof. Group Inf. Theory.

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

[4]  D. Blackwell,et al.  The Capacities of Certain Channel Classes Under Random Coding , 1960 .

[5]  A. S. Holevo.  On Quantum Communication Channels with Constrained Inputs , 1997 .

[6]  H. Nagaoka,et al.  A new proof of the channel coding theorem via hypothesis testing in quantum information theory , 2002, Proceedings IEEE International Symposium on Information Theory,.

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

[8]  A. Holevo.  Coding Theorems for Quantum Channels , 1998, quant-ph/9809023.

[9]  Akio Fujiwara,et al.  Operational Capacity and Pseudoclassicality of a Quantum Channel , 1998, IEEE Trans. Inf. Theory.

[10]  A. Uhlmann.  Entropy and Optimal Decompositions of States Relative to a Maximal Commutative Subalgebra , 1997, quant-ph/9704017.

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

[12]  Masahito Hayashi,et al.  On error exponents in quantum hypothesis testing , 2004, IEEE Transactions on Information Theory.

[13]  Sergio Verdú,et al.  A general formula for channel capacity , 1994, IEEE Trans. Inf. Theory.

[14]  A. Holevo.  Bounds for the quantity of information transmitted by a quantum communication channel , 1973 .

[15]  C. King.  The capacity of the quantum depolarizing channel , 2003, IEEE Trans. Inf. Theory.

[16]  H. Yuen.  Quantum detection and estimation theory , 1978, Proceedings of the IEEE.

[17]  A. Holevo.  Problems in the mathematical theory of quantum communication channels , 1977 .

[18]  P. Shor.  Additivity of the classical capacity of entanglement-breaking quantum channels , 2002, quant-ph/0201149.

[19]  I. Ekeland,et al.  Convex analysis and variational problems , 1976 .

[20]  A. S. Holevo,et al.  Capacity of a quantum communication channel , 1979 .

[21]  C. King.  Additivity for unital qubit channels , 2001, quant-ph/0103156.

[22]  Claude E. Shannon,et al.  Certain Results in Coding Theory for Noisy Channels , 1957, Inf. Control..

[23]  Axthonv G. Oettinger,et al.  IEEE Transactions on Information Theory , 1998 .

[24]  Tomohiro Ogawa,et al.  Strong converse and Stein's lemma in quantum hypothesis testing , 2000, IEEE Trans. Inf. Theory.

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

[26]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[27]  Hiroki Koga,et al.  Information-Spectrum Methods in Information Theory , 2002 .

[28]  Hiroshi Nagaoka,et al.  Numerical Experiments on The Capacity of Quantum Channel with Entangled Input States , 2000 .

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

[30]  Michael D. Westmoreland,et al.  Optimal signal ensembles , 1999, quant-ph/9912122.