Coding theorem and strong converse for quantum channels
- 1 November 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 45 (7) , 2481-2485
- https://doi.org/10.1109/18.796385
Abstract
We present a new proof of Holevo's (1973, 1977) coding theorem for transmitting classical information through quantum channels, and its strong converse. The technique is largely inspired by Wolfwitz's (1964) combinatorial approach using types of sequences. As a byproduct of our approach which is independent of previous ones, both in the coding theorem and the converse, we can give a new proof of Holevo's information bound.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Coding theorems for quantum communication channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Strong converse to the quantum channel coding theoremIEEE Transactions on Information Theory, 1999
- Quantum nonlocality without entanglementPhysical Review A, 1999
- Operational capacity and pseudoclassicality of a quantum channelIEEE Transactions on Information Theory, 1998
- 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
- Classical information capacity of a quantum channelPhysical Review A, 1996
- Quantum codingPhysical Review A, 1995
- Coding Theorems of Information TheoryPublished by Springer Nature ,1964
- A new basic theorem of information theoryTransactions of the IRE Professional Group on Information Theory, 1954