Strong converse and Stein's lemma in quantum hypothesis testing
Top Cited Papers
- 1 November 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 46 (7) , 2428-2433
- https://doi.org/10.1109/18.887855
Abstract
The hypothesis testing problem for two quantum states is treated. We show a new inequality between the errors of the first kind and the second kind, which complements the result of Hiai and Petz (1991) to establish the quantum version of Stein's lemma. The inequality is also used to show a bound on the probability of errors of the first kind when the power exponent for the probability of errors of the second kind exceeds the quantum relative entropy, which yields the strong converse in quantum hypothesis testing. Finally, we discuss the relation between the bound and the power exponent derived by Han and Kobayashi (1989) in classical hypothesis testing.Keywords
This publication has 11 references indexed in Scilit:
- Strong converse theorems in the quantum information theoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Strong converse to the quantum channel coding theoremIEEE Transactions on Information Theory, 1999
- Matrix AnalysisPublished by Springer Nature ,1997
- The proper formula for relative entropy and its asymptotics in quantum probabilityCommunications in Mathematical Physics, 1991
- The strong converse theorem for hypothesis testingIEEE Transactions on Information Theory, 1989
- Quasi-entropies for finite quantum systemsReports on Mathematical Physics, 1986
- Relative entropy and the Wigner-Yanase-Dyson-Lieb concavity in an interpolation theoryCommunications in Mathematical Physics, 1977
- Completely positive maps and entropy inequalitiesCommunications in Mathematical Physics, 1975
- Hypothesis testing and information theoryIEEE Transactions on Information Theory, 1974
- Convex trace functions and the Wigner-Yanase-Dyson conjectureAdvances in Mathematics, 1973