Entanglement assisted classical capacity of a class of quantum channels with long-term memory

In this paper we evaluate the entanglement assisted classical capacity of a class of quantum channels with long-term memory, which are convex combinations of memoryless channels. The memory of such channels can be considered to be given by a Markov chain which is aperiodic but not irreducible. This class of channels was introduced by Datta and Dorlas in (J. Phys. A, Math. Theor. 40:8147–8164, 2007), where its product state capacity was evaluated.

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

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

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

[4]  Igor Devetak.  The private classical capacity and quantum capacity of a quantum channel , 2005, IEEE Transactions on Information Theory.

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

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

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

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

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

[10]  S. Lloyd.  Capacity of the noisy quantum channel , 1996, quant-ph/9604015.

[11]  Schumacher,et al.  Sending entanglement through noisy quantum channels. , 1996, Physical review. A, Atomic, molecular, and optical physics.

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

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

[14]  Andreas J. Winter,et al.  Entanglement-Assisted Capacity of Quantum Multiple-Access Channels , 2008, IEEE Transactions on Information Theory.

[15]  D. Kretschmann.  Quantum channels with memory (19 pages) , 2005 .

[16]  Ashish V. Thapliyal,et al.  Entanglement-Assisted Classical Capacity of Noisy Quantum Channels , 1999, Physical Review Letters.

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

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

[19]  C. Adami,et al.  Capacity of a noisy quantum channel , 1996 .

[20]  A. Holevo.  On entanglement-assisted classical capacity , 2001, quant-ph/0106075.

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

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

[23]  Peter W. Shor,et al.  Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem , 2001, IEEE Trans. Inf. Theory.

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

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

[26]  Michal Horodecki,et al.  A Decoupling Approach to the Quantum Capacity , 2007, Open Syst. Inf. Dyn..