Strong converse to the quantum channel coding theorem
- 1 November 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 45 (7), 2486-2489
- https://doi.org/10.1109/18.796386
Abstract
A lower bound on the probability of decoding error for a quantum communication channel is presented, from which the strong converse to the quantum channel coding theorem is immediately shown. The results and their derivations are mostly straightforward extensions of the classical counterparts which were established by Arimoto (1973), except that more careful treatment is necessary here due to the noncommutativity of operators.Keywords
Other Versions
This publication has 15 references indexed in Scilit:
- Coding theorem and strong converse for quantum channelsIEEE Transactions on Information Theory, 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
- A general formula for channel capacityIEEE Transactions on Information Theory, 1994
- Ultimate information carrying limit of quantum systemsPhysical Review Letters, 1993
- On the converse to the coding theorem for discrete memoryless channels (Corresp.)IEEE Transactions on Information Theory, 1973
- A simple derivation of the coding theorem and some applicationsIEEE Transactions on Information Theory, 1965
- A note on the strong converse of the coding theorem for the general discrete finite-memory channelInformation and Control, 1960