Strong converse theorems in the quantum information theory
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Strong converse theorems for two different subjects in quantum information theory are presented. First, we show a lower bound on the probability of decoding error for a quantum communication channel, from which the strong converse to the quantum channel coding theorem is obtained. Second, we give the strong converse theorem for the quantum hypothesis testing as an application of a new inequality on the error probabilities. This inequality is also used to establish the quantum Stein's lemma.Keywords
This publication has 4 references indexed in Scilit:
- 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
- The proper formula for relative entropy and its asymptotics in quantum probabilityCommunications in Mathematical Physics, 1991
- On the converse to the coding theorem for discrete memoryless channels (Corresp.)IEEE Transactions on Information Theory, 1973