Hypothesis testing / Theorem
Asymptotic quantum Chernoff bound
Theorem statement
Let $\rho$ and $\sigma$ be quantum states on a finite-dimensional system. Denote by $P_e(\rho^{\otimes n}, \sigma^{\otimes n})$ the minimum error probability for distinguishing their $n$-fold tensor powers under equal priors. Then
\[
\lim_{n\to\infty} -\frac{1}{n} \log P_e(\rho^{\otimes n}, \sigma^{\otimes n}) = -\log \min_{0 \le s \le 1} \operatorname{Tr}(\rho^s \sigma^{1-s}).
\]
Sources
- Quantum Information Processing with Finite Resources -- Mathematical Foundations
Marco Tomamichel, 2015
- The Quantum Chernoff Bound
K. M. R. Audenaert, J. Calsamiglia, Ll. Masanes, R. Munoz-Tapia, A. Acin, E. Bagan, F. Verstraete, 2006
- Resources of the Quantum World
Gilad Gour, 2024
Lean context
- Lean declaration
QIT.BinaryHypothesisTest.asymptoticQuantumChernoffBound
Copy a short prompt with the import, Lean declaration, citations, and public source link.