Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2508.12889 · IEEE International Symposium on Information Theory (ISIT)

Generalized quantum Chernoff bound

Kun Fang, Masahito Hayashi

Published Jun 1, 2026• 7 citations
arXivHTMLPDF

Abstract

We consider the task of distinguishing whether a quantum system is prepared in a state from one of several sets of quantum states. Assuming their convexity and stability under tensor product, we prove that the optimal error exponent for discrimination is precisely given by the regularized quantum Chernoff divergence between the sets, thereby establishing a generalized quantum Chernoff bound for the discrimination of multiple sets of quantum states. This extends the classical and quantum Chernoff bounds to the general setting of composite and correlated quantum hypotheses. Furthermore, leveraging minimax theorems, we show that discriminating between sets of quantum states is no harder than discriminating between their worst-case elements in terms of error probability. This implies the existence of an optimal state-agnostic test that achieves the minimum error probability for all states in the sets, matching the performance of the optimal state-dependent test for the most difficult pair of states. We provide explicit characterizations of the optimal state-agnostic test in the binary composite case. Finally, we show that the maximum overlap between a pure state and a set of free states, a quantity that frequently arises in quantum resource theories, is equal to the quantum Chernoff divergence between the sets, thereby providing an operational interpretation of this quantity in the context of symmetric hypothesis testing.

DOI
10.1109/isit62367.2026.11653833

Related papers

An asymptotic error bound for testing multiple quantum hypotheses

Michael Nussbaum, Arleta Szkoła

We consider the problem of detecting the true quantum state among r possible ones, based of measurements performed on n copies of a finite-dimensional quantum system. A special case is the problem of discriminating between r probability measures on a finite sample space, using n i.i.d. observations. In this classical setting, it is known that the averaged error probability decreases exponentially with exponent given by the worst case binary Chernoff bound between any possible pair of the r probability measures. Define analogously the multiple quantum Chernoff bound, considering all possible pairs of states. Recently, it has been shown that this asymptotic error bound is attainable in the case of r pure states, and that it is unimprovable in general. Here we extend the attainability result to a larger class of r-tuples of states which are possibly mixed, but pairwise linearly independent. We also construct a quantum detector which universally attains the multiple quantum Chernoff bound up to a factor 1/3.

arXiv:1112.1529•The Annals of Statistics•Dec 1, 2011•21 citations

Error Exponents of Quantum State Discrimination With Composite Correlated Hypotheses

Kun Fang, Masahito Hayashi

We study the error exponents in quantum hypothesis testing between two sets of quantum states, extending the analysis beyond the independent and identically distributed case to encompass composite correlated hypotheses. In particular, we introduce and compare two natural extensions of the quantum Hoeffding divergence and anti-divergence to sets of quantum states, establishing their equivalence or quantitative relations. In the error exponent regime, we generalize the quantum Hoeffding bound to stable sequences of convex, compact sets of quantum states, demonstrating that the optimal Type-I error exponent, under an exponential constraint on the Type-II error, is precisely characterized by the regularized quantum Hoeffding divergence between the sets. In the strong converse exponent regime, we establish a general lower bound on the exponent in terms of the regularized quantum Hoeffding anti-divergence, and we prove a matching upper bound when the null hypothesis is a singleton, under additional assumptions. The generality of these results enables applications in various contexts, including (i) refining the generalized quantum Stein’s lemma by [Fang, Fawzi & Fawzi, 2024]; (ii) exhibiting counterexamples to the continuity of the regularized Petz R´enyi divergence and Hoeffding divergence; (iii) obtaining error exponents for adversarial channel discrimination and resource detection problems.

arXiv:2508.12901•IEEE International Symposium on Information Theory (ISIT)•Apr 16, 2026•9 citations

Multiple Quantum Hypothesis Testing: One-Shot Pairwise Bounds and Sharp Asymptotics

Hao-Chung Cheng, Po-Chieh Liu

We consider Bayesian discrimination among multiple quantum states and establish a dimension-free one-shot upper bound on the minimum probability of error in terms of the sum of pairwise errors. This resolves a conjecture of Audenaert and Mosonyi [J. Math. Phys. 55 (2014)] and improves the multiple quantum Chernoff bound of Li [Ann. Statist. 44 (2016)] by removing its dimension-dependent prefactor. In the asymptotic many-copy regime, our bound proves the achievability of the multiple quantum Chernoff distance for arbitrary separable Hilbert spaces, thereby settling the previously open infinite-dimensional case, and further yields constant-factor sharp asymptotics for the optimal error probability. In binary quantum hypothesis testing, we prove that the minimum error probability is characterized, up to universal constants, by a trace harmonic-mean quantity. Consequently, the optimal binary quantum error probability is within a factor of two of the optimal classical error probability for the associated Nussbaum-Szkoła distributions, complementing the lower bound of Nussbaum and Szkoła [Ann. Statist. 37 (2009)].

quant-pharXiv:2606.06246•Jun 5, 2026•5 citations

Discriminating quantum states: The multiple Chernoff distance

Ke Li

We consider the problem of testing multiple quantum hypotheses $\{\rho_{1}^{\otimes n},\ldots,\rho_{r}^{\otimes n}\}$, where an arbitrary prior distribution is given and each of the $r$ hypotheses is $n$ copies of a quantum state. It is known that the minimal average error probability $P_{e}$ decays exponentially to zero, that is, $P_{e}=\exp\{-\xi n+o(n)\}$. However, this error exponent $\xi$ is generally unknown, except for the case that $r=2$. In this paper, we solve the long-standing open problem of identifying the above error exponent, by proving Nussbaum and Szkoła’s conjecture that $\xi=\min_{i\neq j}C(\rho_{i},\rho_{j})$. The right-hand side of this equality is called the multiple quantum Chernoff distance, and $C(\rho_{i},\rho_{j}):=\max_{0\leq s\leq1}\{-\log\operatorname{Tr}\rho_{i}^{s}\rho_{j}^{1-s}\}$ has been previously identified as the optimal error exponent for testing two hypotheses, $\rho_{i}^{\otimes n}$ versus $\rho_{j}^{\otimes n}$. The main ingredient of our proof is a new upper bound for the average error probability, for testing an ensemble of finite-dimensional, but otherwise general, quantum states. This upper bound, up to a states-dependent factor, matches the multiple-state generalization of Nussbaum and Szkoła’s lower bound. Specialized to the case $r=2$, we give an alternative proof to the achievability of the binary-hypothesis Chernoff distance, which was originally proved by Audenaert et al.

arXiv:1508.06624•The Annals of Statistics•Jul 7, 2016•61 citations

The Chernoff lower bound for symmetric quantum hypothesis testing

Michael Nussbaum, Arleta Szkola

We consider symmetric hypothesis testing in quantum statistics, where the hypotheses are density operators on a finite-dimensional complex Hilbert space, representing states of a finite quantum system. We prove a lower bound on the asymptotic rate exponents of Bayesian error probabilities. The bound represents a quantum extension of the Chernoff bound, which gives the best asymptotically achievable error exponent in classical discrimination between two probability measures on a finite set. In our framework, the classical result is reproduced if the two hypothetic density operators commute. Recently, it has been shown elsewhere [Phys. Rev. Lett. 98 (2007) 160504] that the lower bound is achievable also in the generic quantum (noncommutative) case. This implies that our result is one part of the definitive quantum Chernoff bound. 1

•Jan 1, 2009•130 citations

The Chernoff lower bound for symmetric quantum hypothesis testing

Michael Nussbaum, Arleta Szkoła

We consider symmetric hypothesis testing in quantum statistics, where the hypotheses are density operators on a finite-dimensional complex Hilbert space, representing states of a finite quantum system. We prove a lower bound on the asymptotic rate exponents of Bayesian error probabilities. The bound represents a quantum extension of the Chernoff bound, which gives the best asymptotically achievable error exponent in classical discrimination between two probability measures on a finite set. In our framework, the classical result is reproduced if the two hypothetic density operators commute. Recently, it has been shown elsewhere [Phys. Rev. Lett. 98 (2007) 160504] that the lower bound is achievable also in the generic quantum (noncommutative) case. This implies that our result is one part of the definitive quantum Chernoff bound.

arXiv:quant-ph/0607216•The Annals of Statistics•Mar 10, 2009•238 citations
We consider the task of distinguishing whether a quantum system is prepared in a state from one of several sets of quantum states. Assuming their convexity and stability under tensor product, we prove that the optimal error exponent for discrimination is precisely given by the regularized quantum Chernoff divergence between the sets, thereby establishing a generalized quantum Chernoff bound for the discrimination of multiple sets of quantum states. This extends the classical and quantum Chernoff bounds to the general setting of composite and correlated quantum hypotheses. Furthermore, leveraging minimax theorems, we show that discriminating between sets of quantum states is no harder than discriminating between their worst-case elements in terms of error probability. This implies the existence of an optimal state-agnostic test that achieves the minimum error probability for all states in the sets, matching the performance of the optimal state-dependent test for the most difficult pair of states. We provide explicit characterizations of the optimal state-agnostic test in the binary composite case. Finally, we show that the maximum overlap between a pure state and a set of free states, a quantity that frequently arises in quantum resource theories, is equal to the quantum Chernoff divergence between the sets, thereby providing an operational interpretation of this quantity in the context of symmetric hypothesis testing.
We consider the problem of detecting the true quantum state among r possible ones, based of measurements performed on n copies of a finite-dimensional quantum system. A special case is the problem of discriminating between r probability measures on a finite sample space, using n i.i.d. observations. In this classical setting, it is known that the averaged error probability decreases exponentially with exponent given by the worst case binary Chernoff bound between any possible pair of the r probability measures. Define analogously the multiple quantum Chernoff bound, considering all possible pairs of states. Recently, it has been shown that this asymptotic error bound is attainable in the case of r pure states, and that it is unimprovable in general. Here we extend the attainability result to a larger class of r-tuples of states which are possibly mixed, but pairwise linearly independent. We also construct a quantum detector which universally attains the multiple quantum Chernoff bound up to a factor 1/3.
We study the error exponents in quantum hypothesis testing between two sets of quantum states, extending the analysis beyond the independent and identically distributed case to encompass composite correlated hypotheses. In particular, we introduce and compare two natural extensions of the quantum Hoeffding divergence and anti-divergence to sets of quantum states, establishing their equivalence or quantitative relations. In the error exponent regime, we generalize the quantum Hoeffding bound to stable sequences of convex, compact sets of quantum states, demonstrating that the optimal Type-I error exponent, under an exponential constraint on the Type-II error, is precisely characterized by the regularized quantum Hoeffding divergence between the sets. In the strong converse exponent regime, we establish a general lower bound on the exponent in terms of the regularized quantum Hoeffding anti-divergence, and we prove a matching upper bound when the null hypothesis is a singleton, under additional assumptions. The generality of these results enables applications in various contexts, including (i) refining the generalized quantum Stein’s lemma by [Fang, Fawzi & Fawzi, 2024]; (ii) exhibiting counterexamples to the continuity of the regularized Petz R´enyi divergence and Hoeffding divergence; (iii) obtaining error exponents for adversarial channel discrimination and resource detection problems.
We consider Bayesian discrimination among multiple quantum states and establish a dimension-free one-shot upper bound on the minimum probability of error in terms of the sum of pairwise errors. This resolves a conjecture of Audenaert and Mosonyi [J. Math. Phys. 55 (2014)] and improves the multiple quantum Chernoff bound of Li [Ann. Statist. 44 (2016)] by removing its dimension-dependent prefactor. In the asymptotic many-copy regime, our bound proves the achievability of the multiple quantum Chernoff distance for arbitrary separable Hilbert spaces, thereby settling the previously open infinite-dimensional case, and further yields constant-factor sharp asymptotics for the optimal error probability. In binary quantum hypothesis testing, we prove that the minimum error probability is characterized, up to universal constants, by a trace harmonic-mean quantity. Consequently, the optimal binary quantum error probability is within a factor of two of the optimal classical error probability for the associated Nussbaum-Szkoła distributions, complementing the lower bound of Nussbaum and Szkoła [Ann. Statist. 37 (2009)].
We consider the problem of testing multiple quantum hypotheses {ρ1⊗n,…,ρr⊗n}\{\rho_{1}^{\otimes n},\ldots,\rho_{r}^{\otimes n}\}{ρ1⊗n​,…,ρr⊗n​}, where an arbitrary prior distribution is given and each of the rrr hypotheses is nnn copies of a quantum state. It is known that the minimal average error probability PeP_{e}Pe​ decays exponentially to zero, that is, Pe=exp⁡{−ξn+o(n)}P_{e}=\exp\{-\xi n+o(n)\}Pe​=exp{−ξn+o(n)}. However, this error exponent ξ\xiξ is generally unknown, except for the case that r=2r=2r=2. In this paper, we solve the long-standing open problem of identifying the above error exponent, by proving Nussbaum and Szkoła’s conjecture that ξ=min⁡i≠jC(ρi,ρj)\xi=\min_{i\neq j}C(\rho_{i},\rho_{j})ξ=mini=j​C(ρi​,ρj​). The right-hand side of this equality is called the multiple quantum Chernoff distance, and C(ρi,ρj):=max⁡0≤s≤1{−log⁡Tr⁡ρisρj1−s}C(\rho_{i},\rho_{j}):=\max_{0\leq s\leq1}\{-\log\operatorname{Tr}\rho_{i}^{s}\rho_{j}^{1-s}\}C(ρi​,ρj​):=max0≤s≤1​{−logTrρis​ρj1−s​} has been previously identified as the optimal error exponent for testing two hypotheses, ρi⊗n\rho_{i}^{\otimes n}ρi⊗n​ versus ρj⊗n\rho_{j}^{\otimes n}ρj⊗n​. The main ingredient of our proof is a new upper bound for the average error probability, for testing an ensemble of finite-dimensional, but otherwise general, quantum states. This upper bound, up to a states-dependent factor, matches the multiple-state generalization of Nussbaum and Szkoła’s lower bound. Specialized to the case r=2r=2r=2, we give an alternative proof to the achievability of the binary-hypothesis Chernoff distance, which was originally proved by Audenaert et al.
We consider symmetric hypothesis testing in quantum statistics, where the hypotheses are density operators on a finite-dimensional complex Hilbert space, representing states of a finite quantum system. We prove a lower bound on the asymptotic rate exponents of Bayesian error probabilities. The bound represents a quantum extension of the Chernoff bound, which gives the best asymptotically achievable error exponent in classical discrimination between two probability measures on a finite set. In our framework, the classical result is reproduced if the two hypothetic density operators commute. Recently, it has been shown elsewhere [Phys. Rev. Lett. 98 (2007) 160504] that the lower bound is achievable also in the generic quantum (noncommutative) case. This implies that our result is one part of the definitive quantum Chernoff bound. 1
We consider symmetric hypothesis testing in quantum statistics, where the hypotheses are density operators on a finite-dimensional complex Hilbert space, representing states of a finite quantum system. We prove a lower bound on the asymptotic rate exponents of Bayesian error probabilities. The bound represents a quantum extension of the Chernoff bound, which gives the best asymptotically achievable error exponent in classical discrimination between two probability measures on a finite set. In our framework, the classical result is reproduced if the two hypothetic density operators commute. Recently, it has been shown elsewhere [Phys. Rev. Lett. 98 (2007) 160504] that the lower bound is achievable also in the generic quantum (noncommutative) case. This implies that our result is one part of the definitive quantum Chernoff bound.