Classical Capacity of Quantum Channels with General Markovian Correlated Noise

The classical capacity of a quantum channel with arbitrary Markovian correlated noise is evaluated. For the general case of a channel with long-term memory, which corresponds to a Markov chain which does not converge to equilibrium, the capacity is expressed in terms of the communicating classes of the Markov chain. For an irreducible and aperiodic Markov chain, the channel is forgetful, and one retrieves the known expression (Kretschmann and Werner in Phys. Rev. A 72:062323, 2005) for the capacity.

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

[2]  Aleksandr Yakovlevich Khinchin,et al.  Mathematical foundations of information theory , 1959 .

[3]  W. Ames.  Mathematics in Science and Engineering , 1999 .

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

[5]  Holger Boche,et al.  Classical Capacities of Compound and Averaged Quantum Channels , 2007, IEEE Transactions on Information Theory.

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

[7]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[8]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[9]  B. McMillan.  The Basic Theorems of Information Theory , 1953 .

[10]  D. Vere-Jones.  Markov Chains , 1972, Nature.

[11]  R. Werner,et al.  Quantum channels with memory , 2005, quant-ph/0502106.

[12]  C. Helstrom.  Quantum detection and estimation theory , 1969 .

[13]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

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

[15]  Masahito Hayashi,et al.  General formulas for capacity of classical-quantum channels , 2003, IEEE Transactions on Information Theory.

[16]  Nilanjana Datta,et al.  A quantum version of Feinstein's Theorem and its application to channel coding , 2006, 2006 IEEE International Symposium on Information Theory.

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

[18]  Holger Boche,et al.  Ergodic Classical-Quantum Channels: Structure and Coding Theorems , 2006, IEEE Transactions on Information Theory.

[19]  D. Petz,et al.  Quantum Entropy and Its Use , 1993 .

[20]  Holger Boche,et al.  Classical Capacities of Averaged and Compound Quantum Channels , 2007, ArXiv.

[21]  A~nsw~dr.  The Weak Capacity of Averaged Channels , 1967 .

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

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

[24]  C. Macchiavello,et al.  Entanglement-enhanced information transmission over a quantum channel with correlated noise , 2001, quant-ph/0107052.

[25]  Claude E. Shannon,et al.  The mathematical theory of communication , 1950 .

[26]  S. Mancini,et al.  Quantum channels with a finite memory , 2003, quant-ph/0305010.