The coding theorem for a class of quantum channels with long-term memory

In this paper, we consider the transmission of classical information through a class of quantum channels with long-term memory, which are convex combinations of memoryless channels. Hence, the memory of such channels can be considered to be given by a Markov chain which is aperiodic but not irreducible. We prove the coding theorem and weak converse for this class of channels. The main techniques that we employ are a quantum version of Feinstein's fundamental lemma (Feinstein A 1954 IRE Trans. PGIT 4 2–22, Khinchin A I 1957 Mathematical Foundations of Information Theory: II. On the Fundamental Theorems of Information Theory (New York: Dover) chapter IV) and a generalization of Helstrom's theorem (Helstrom C W 1976 Quantum detection and estimation theory Mathematics in Science and Engineering vol 123 (London: Academic)).

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

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

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

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

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

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

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

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

[9]  Schumacher,et al.  Quantum coding. , 1995, Physical review. A, Atomic, molecular, and optical physics.

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

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

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

[13]  Igor Bjelakovic,et al.  The Shannon-McMillan theorem for ergodic quantum lattice systems , 2002, ArXiv.

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

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

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

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

[18]  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.

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

[20]  Thomas Schonhoff.  Detection and Estimation Theory , 2006 .

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

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

[23]  Nilanjana Datta,et al.  Classical Capacity of Quantum Channels with General Markovian Correlated Noise , 2007, 0712.0722.