Asymptotic Error Rates in Quantum Hypothesis Testing
K.M.R. Audenaert, M. Nussbaum, A. Szkola, F. Verstraete

TL;DR
This paper derives the asymptotic error rates for quantum hypothesis testing, generalizing classical distances and providing a unified, full generality proof with new techniques, highlighting the quantum Chernoff distance as a natural measure.
Contribution
It presents a unified, comprehensive proof of quantum asymptotic error rates, including the quantum Chernoff distance, for states with different supports, using new techniques.
Findings
Quantum Chernoff distance identified as a natural measure.
Unified proof for quantum hypothesis testing error rates.
Extension to states with different supports.
Abstract
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 specified error probability tends to zero. This leads to the identification of the quantum generalisation of the classical Chernoff distance. The proof relies on two new techniques that have been introduced in [quant-ph/0610027] and [quant-ph/0607216], respectively, and that are also well suited to prove the quantum generalisation of the Hoeffding bound, which is a modification of the Chernoff distance and specifies the optimal achievable asymptotic error rate in the context of asymmetric hypothesis testing. This has been done subsequently by Hayashi [quant-ph/0611013] and Nagaoka [quant-ph/0611289] for the special case where both hypotheses have full support.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Quantum Mechanics and Applications · Quantum Information and Cryptography
