The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Asymptotic Error Rates in Quantum Hypothesis Testing
Open accessAbstract
We consider the problem of discriminating between two different states of a finite quantum system in the setting of large numbers of copies, and find a closed form expression for the asymptotic exponential rate at which the error probability tends to zero. This leads to the identification of the quantum generalisation of the classical Chernoff distance, which is the corresponding quantity in classical symmetric hypothesis testing. The proof relies on two new techniques introduced by the authors, which are also well suited to tackle the corresponding problem in asymmetric hypothesis testing, yielding the quantum generalisation of the classical Hoeffding bound. This has been done by Hayashi and Nagaoka for the special case where the states have full support. The goal of this paper is to present the proofs of these results in a unified way and in full generality, allowing hypothesis states with different supports. From the quantum Hoeffding bound, we then easily derive quantum Stein’s Lemma and quantum Sanov’s theorem. We give an in-depth treatment of the properties of the quantum Chernoff distance, and argue that it is a natural distance measure on the set of density operators, with a clear operational meaning.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Vaart, A. W. V. D. (1998) · doi:10.1017/cbo9780511802256 · Cited by 4,159
Quantum detection and estimation theory
Helstrom, C. W. (1969) · Journal of Statistical Physics · doi:10.1007/bf01007479 · Cited by 3,776
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
Chernoff, H. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729330 · Cited by 3,550
Bhatia, R. (1996) · Cited by 2,847
Quantum Detection and Estimation Theory
(1976) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6017-5 · Cited by 2,426
Bhatia, R. (1997) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0653-8 · Cited by 2,336
The ‘transition probability’ in the state space of a—algebra
Uhlmann, A. (1976) · Reports on Mathematical Physics · doi:10.1016/0034-4877(76)90060-4 · Cited by 1,649
Cryptographic distinguishability measures for quantum-mechanical states
Fuchs, C. A., & van de Graaf, J. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.761271 · Cited by 773
Convex trace functions and the Wigner-Yanase-Dyson conjecture
Lieb, E. H. (1973) · Advances in Mathematics · doi:10.1016/0001-8708(73)90011-x · Cited by 653
Discriminating States: The Quantum Chernoff Bound
Audenaert, K. M. R., Calsamiglia, J., Muñoz-Tapia, R., Bagan, E., Masanes, L., Acin, A., & Verstraete, F. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.160501 · Cited by 524
Self-citationThe proper formula for relative entropy and its asymptotics in quantum probability
Hiai, F., & Petz, D. (1991) · Communications in Mathematical Physics · doi:10.1007/bf02100287 · Cited by 522
Quasi-entropies for finite quantum systems
Petz, D. (1986) · Reports on Mathematical Physics · doi:10.1016/0034-4877(86)90067-4 · Cited by 500
(1998) · Asymptotic Statistics · doi:10.1017/cbo9780511802256.013 · Cited by 421
Quantum information : an introduction
林, 正. (2006) · Springer eBooks · Cited by 328
Strong converse and Stein's lemma in quantum hypothesis testing
Nagaoka, H., & Ogawa, T. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.887855 · Cited by 324
Hayashi, M. (2007) · Physical Review A · doi:10.1103/physreva.76.062301 · Cited by 174
Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
Bacon, D., Chuang, I. L., & Harrow, A. W. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.170502 · Cited by 163
Monotone Riemannian metrics and relative entropy on noncommutative probability spaces
Lesniewski, A., & Ruskai, M. B. (1999) · Journal of Mathematical Physics · doi:10.1063/1.533053 · Cited by 163
The Converse Part of The Theorem for Quantum Hoeffding BoundPreprint
Nagaoka, H. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0611289 · Cited by 143
On Asymptotically Optimal Hypothesis Testing in Quantum Statistics
Холево, А. С. (1979) · Theory of Probability and Its Applications · doi:10.1137/1123048 · Cited by 104
A Quantum Version of Sanov's Theorem
Bjelaković, I., Deuschel, J., Krüger, T., Seiler, R., Siegmund‐Schultze, R., & Szkoła, A. (2005) · Communications in Mathematical Physics · doi:10.1007/s00220-005-1426-2 · Cited by 72
Self-citationHayashi, M. (2006) · Cited by 66
On the Chernoff bound for efficiency of quantum hypothesis testing
Kargin, V. (2005) · The Annals of Statistics · doi:10.1214/009053604000001219 · Cited by 52
Asymptotics of quantum relative entropy from a representation theoretical viewpoint
Hayashi, M. (2001) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/34/16/309 · Cited by 44
A lower bound of Chernoff type for symmetric quantum hypothesis testingPreprint
Nussbaum, M., & Szkoła, A. (2006) · arXiv (Cornell University) · Cited by 21
Self-citation(2006) · doi:10.1007/3-540-30266-2 · Cited by 12
Cited by
Weedbrook, C., Pirandola, S., García-Patrón, R., Cerf, N. J., Ralph, T. C., Shapiro, J. H., & Lloyd, S. (2012) · Reviews of Modern Physics · doi:10.1103/revmodphys.84.621 · Cited by 3,664
Microwave Quantum Illumination
Barzanjeh, S., Guha, S., Weedbrook, C., Vitali, D., Shapiro, J. H., & Pirandola, S. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.080503 · Cited by 485
Quantum Information Processing with Finite Resources
Tomamichel, M. (2016) · SpringerBriefs in Mathematical Physics · doi:10.1007/978-3-319-21891-5 · Cited by 329
Quantum state discrimination and its applications
Bae, J., & Kwek, L.-C. (2015) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/48/8/083001 · Cited by 320
Quantum Fidelity for Arbitrary Gaussian States
Banchi, L., Braunstein, S. L., & Pirandola, S. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.260501 · Cited by 259
Metadata
- Authors
- Audenaert, K. M. R., Nussbaum, M., Szkoła, A., & Verstraete, F.
- Venue
- Communications in Mathematical Physics
- Published
- 2008-02-08
- Volume
- 279
- Issue
- 1
- Pages
- 251-283
- ISSN
- 0010-3616 (ISSN-L)
- 1432-0916
- OpenAlex
- W1996053641
- Cited by
- 274
- References
- 26
- FWCI
- 15.37
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.