The coding theorem for a class of quantum channels with long-term memory
- 27 June 2007
- journal article
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 40 (28), 8147-8164
- https://doi.org/10.1088/1751-8113/40/28/s20
Abstract
In this paper we consider the transmission of classical information through a class of quantum channels with long-term memory, which are given by convex combinations of product channels. Hence, the memory of such channels is 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 and a generalization of Helstrom's Theorem.Keywords
Other Versions
This publication has 12 references indexed in Scilit:
- General formulas for capacity of classical-quantum channelsIEEE Transactions on Information Theory, 2003
- Entanglement-enhanced information transmission over a quantum channel with correlated noisePhysical Review A, 2002
- The capacity of the quantum channel with general signal statesIEEE Transactions on Information Theory, 1998
- Sending classical information via noisy quantum channelsPhysical Review A, 1997
- Quantum codingPhysical Review A, 1995
- Quantum Entropy and Its UsePublished by Springer Science and Business Media LLC ,1993
- The proper formula for relative entropy and its asymptotics in quantum probabilityCommunications in Mathematical Physics, 1991
- The weak capacity of averaged channelsProbability Theory and Related Fields, 1968
- A new basic theorem of information theoryTransactions of the IRE Professional Group on Information Theory, 1954
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948