Strong converse for identification via quantum channels
Top Cited Papers
- 7 August 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 48 (3) , 569-579
- https://doi.org/10.1109/18.985947
Abstract
We present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede's (1979, 1992) approach to classical channels. It involves a development of explicit large deviation estimates to the case of random variables taking values in self-adjoint operators on a Hilbert space. This theory is presented separately in an appendix, and we illustrate it by showing its application to quantum generalizations of classical hypergraph covering problems.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Compression of quantum-measurement operationsPhysical Review A, 2001
- Coding theorem and strong converse for quantum channelsIEEE Transactions on Information Theory, 1999
- Strong converse to the quantum channel coding theoremIEEE Transactions on Information Theory, 1999
- The capacity of the quantum channel with general signal statesIEEE Transactions on Information Theory, 1998
- Identification via channelsIEEE Transactions on Information Theory, 1989
- Problems in the mathematical theory of quantum communication channelsReports on Mathematical Physics, 1977
- Convex trace functions and the Wigner-Yanase-Dyson conjectureAdvances in Mathematics, 1973
- Hide and Seek, Data Storage, and EntropyThe Annals of Mathematical Statistics, 1971
- Lower Bounds for the Helmholtz FunctionPhysical Review B, 1965
- ber monotone MatrixfunktionenMathematische Zeitschrift, 1934