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:2611.00931

Binary Quantum Hypothesis Testing with a Rejection Option: The Exact Error-Exponent Trade-off

Yonglong Li

quant-phmath-phSubmitted Oct 31, 2026• Announced Nov 3, 2026• 0 citations
arXivHTMLPDF

Abstract

We characterize the exact error-exponent trade-off in binary quantum hypothesis testing with a rejection option for faithful states on a finite-dimensional Hilbert space. The probabilities of rejection under the two hypotheses are required to vanish exponentially, with exponents at least $K$ and $L$. We show that a quadruple $(a,b,K,L)$ of positive error and rejection exponents is achievable if and only if it satisfies three single-letter conditions: two conditions involve Petz--Rényi quantities and coincide with the converse bound conjectured to be tight by Ji and Regula; the third involves the $α$--$z$ Rényi quantities on the triangle $\max\{α,1-α\}\le z\le1$. The proof combines a sector decomposition inside Schur--Weyl blocks, an explicit one-shot measurement construction, and an exact minimax argument.

AI Summary

The paper determines the joint trade-off between two error exponents and two rejection exponents in binary i.i.d. quantum hypothesis testing. For distinct faithful states $\rho,\sigma$ in finite dimension, a three-outcome collective measurement may accept either hypothesis or reject both; rejection probabilities must decay with exponents at least $K,L>0$. A positive quadruple $(a,b,K,L)$ is achievable exactly when three single-letter conditions hold. Two are the previously known Petz–Rényi converse: $(\min\{a,K\},b)$ and $(a,\min\{b,L\})$ must lie in the binary quantum Hoeffding region. The additional condition is that, for some $\max\{\alpha,1-\alpha\}\le z\le1$, $(\alpha+z-1)a+(z-\alpha)b+(1-z)(K+L)\le-\log Q_{\alpha,z}(\rho\|\sigma)$. This condition is automatic when $K+L\le-2\log F(\rho,\sigma)$, with $F$ the root fidelity. Above this threshold, the Petz converse can be non-tight. A qubit example exhibits an interior $\alpha$–$z$ optimizer and a discontinuity in the optimal equal-error exponent. The proof combines Schur–Weyl blocks, sector exponents tracking spectral weights and eigenspace overlaps, an exact minimax argument, and an explicit one-shot measurement construction. Achievability bounds all four probabilities by their target exponentials times $800(n+1)^{3(d^2-1)}$. The result assumes faithful, finite-dimensional states and positive exponents. For rejection budgets imposed exactly at every blocklength, the same region is established except on $K+L=-2\log F$, where the general noncommuting case remains unresolved. The bounds are not second-order asymptotics; extensions to multiple, composite, or correlated hypotheses remain open.

Little sign of AI-generated textAI use disclosed
The author used ChatGPT 5.6 Sol (OpenAI) to assist with mathematical derivations and proof checking, numerical calculations, language editing, and LaTeX preparation.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

On the Error Exponents of Binary State Discrimination With Composite Hypotheses

Milán Mosonyi, Zsombor Szilágyi, Mihály Weiner

The trade-off between the two types of error probabilities in binary state discrimination may be quantified in the asymptotics by various error exponents. In the composite case, where the hypotheses consist of sets of states, any such exponent is upper bounded by the infimum of the corresponding pairwise exponents of discriminating individual members of the two sets. Attainability of this upper bound may depend on the type of exponents considered; whether the problem is classical or quantum; the cardinality and the geometric properties of the sets representing the hypotheses; and also on the dimensionality of the underlying Hilbert space. Our main contribution is clarifying this landscape considerably. We show that in the quantum case unattainability is the general behaviour for all the exponents, already in finite dimension, for a simple null-hypothesis and an alternative hypothesis consisting of only two states. Moreover, the upper bound may be strict even in the infinite-dimensional classical case if the alternative hypothesis contains at least countably infinitely many states. We also prove general attainability results, e.g., for classical adversarial and arbitrarily varying hypothesis testing, and for the quantum case where all states are pure, or the states commute with every state in the opposite hypothesis.

arXiv:2011.04645•IEEE Transactions on Information Theory•Nov 8, 2021•23 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

Beyond Hoeffding and Chernoff: Trading conclusiveness for advantages in quantum hypothesis testing

Kaiyuan Ji, Bartosz Regula

The ultimate limits of quantum state discrimination are often thought to be captured by asymptotic bounds that restrict the achievable error probabilities, notably the quantum Chernoff and Hoeffding bounds. Here we study hypothesis testing protocols that are permitted a probability of producing an inconclusive discrimination outcome, and investigate their performance when this probability is suitably constrained. We show that even by allowing an arbitrarily small probability of inconclusiveness, the limits imposed by the quantum Hoeffding and Chernoff bounds can be significantly exceeded. This completely circumvents the conventional trade-offs between error exponents in hypothesis testing while incurring only a vanishingly small overhead over conventional approaches. Such improvements over standard state discrimination are robust and can be obtained even when an exponentially vanishing probability of inconclusive outcomes is demanded. Relaxing the constraints on the inconclusive probability can enable even larger advantages, but this comes at a price. We show a 'strong converse' property of this setting: targeting error exponents beyond those achievable with vanishing inconclusiveness necessarily forces the probability of inconclusive outcomes to converge to one. By exactly quantifying the rate of this convergence, we give a complete characterisation of the trade-offs between error exponents and rates of conclusive outcome probabilities. Overall, our results provide a comprehensive asymptotic picture of how the allowance for inconclusive measurement outcomes reshapes optimal quantum hypothesis testing.

arXiv:2510.07601•Oct 8, 2025•6 citations

Sharp pairwise reduction for quantum hypothesis testing

Kuan-Yi Lee, Ludovico Lami

We determine the optimal universal coefficient in a reduction of multiple to binary quantum hypothesis testing. Specifically, for every finite ensemble in any Hilbert space dimension (finite or infinite), we prove that the error probability of the global pretty good measurement (PGM) is at most four times the sum of the optimal binary error probabilities. By constructing a family of regular-simplex ensembles, we further show that the coefficient four is optimal, even for arbitrary global measurements. This result improves on the pairwise bounds established by Cheng and Liu [arXiv:2606.06246 (2026)] and entails an explicit, sharp guarantee for the standard PGM itself. Our proof is also simpler: rather than constructing sequential measurements and applying a union bound, our proof relies on purely matrix-analytic techniques, combining a direct block Gram matrix analysis of the PGM error and a refined inequality between quantum Hellinger distance and Bures $χ^2$-divergence. Our analysis also yields a refined, one-shot pairwise Chernoff bound and explicit sufficient number of copies for a desired discrimination error.

quant-pharXiv:2609.28440•Sep 24, 2026•2 citations

Postselected Quantum Hypothesis Testing

Bartosz Regula, Ludovico Lami, Mark M. Wilde

We study a variant of quantum hypothesis testing wherein an additional ‘inconclusive’ measurement outcome is added, allowing one to abstain from attempting to discriminate the hypotheses. The error probabilities are then conditioned on a successful attempt, with inconclusive trials disregarded. We completely characterise this task in both the single-shot and asymptotic regimes, providing exact formulas for the optimal error probabilities. In particular, we prove that the asymptotic error exponent of discriminating any two quantum states$\rho $and$\sigma $is given by the Hilbert projective metric$D_{\max }(\rho \|\sigma ) + D_{\max }(\sigma \| \rho )$in asymmetric hypothesis testing, and by the Thompson metric$\max \! \big \{ D_{\max }(\rho \|\sigma ),\, D_{\max }(\sigma \| \rho ) \big \}$in symmetric hypothesis testing. This endows these two quantities with fundamental operational interpretations in quantum state discrimination. Our findings extend to composite hypothesis testing, where we show that the asymmetric error exponent with respect to any convex set of density matrices is given by a regularisation of the Hilbert projective metric. We apply our results also to quantum channels, showing that no advantage is gained by employing adaptive or even more general discrimination schemes over parallel ones, in both the asymmetric and symmetric settings. Our state discrimination results make use of no properties specific to quantum mechanics and are also valid in general probabilistic theories.

arXiv:2209.10550•IEEE Transactions on Information Theory•Jul 28, 2023•20 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
We characterize the exact error-exponent trade-off in binary quantum hypothesis testing with a rejection option for faithful states on a finite-dimensional Hilbert space. The probabilities of rejection under the two hypotheses are required to vanish exponentially, with exponents at least KKK and LLL. We show that a quadruple (a,b,K,L)(a,b,K,L)(a,b,K,L) of positive error and rejection exponents is achievable if and only if it satisfies three single-letter conditions: two conditions involve Petz--Rényi quantities and coincide with the converse bound conjectured to be tight by Ji and Regula; the third involves the ααα--zzz Rényi quantities on the triangle max⁡{α,1−α}≤z≤1\max\{α,1-α\}\le z\le1max{α,1−α}≤z≤1. The proof combines a sector decomposition inside Schur--Weyl blocks, an explicit one-shot measurement construction, and an exact minimax argument.
The paper determines the joint trade-off between two error exponents and two rejection exponents in binary i.i.d. quantum hypothesis testing. For distinct faithful states ρ,σ\rho,\sigmaρ,σ in finite dimension, a three-outcome collective measurement may accept either hypothesis or reject both; rejection probabilities must decay with exponents at least K,L>0K,L>0K,L>0.
A positive quadruple (a,b,K,L)(a,b,K,L)(a,b,K,L) is achievable exactly when three single-letter conditions hold. Two are the previously known Petz–Rényi converse: (min⁡{a,K},b)(\min\{a,K\},b)(min{a,K},b) and (a,min⁡{b,L})(a,\min\{b,L\})(a,min{b,L}) must lie in the binary quantum Hoeffding region. The additional condition is that, for some max⁡{α,1−α}≤z≤1\max\{\alpha,1-\alpha\}\le z\le1max{α,1−α}≤z≤1,
(α+z−1)a+(z−α)b+(1−z)(K+L)≤−log⁡Qα,z(ρ∥σ)(\alpha+z-1)a+(z-\alpha)b+(1-z)(K+L)\le-\log Q_{\alpha,z}(\rho\|\sigma)(α+z−1)a+(z−α)b+(1−z)(K+L)≤−logQα,z​(ρ∥σ).
This condition is automatic when K+L≤−2log⁡F(ρ,σ)K+L\le-2\log F(\rho,\sigma)K+L≤−2logF(ρ,σ), with FFF the root fidelity. Above this threshold, the Petz converse can be non-tight. A qubit example exhibits an interior α\alphaα–zzz optimizer and a discontinuity in the optimal equal-error exponent.
The proof combines Schur–Weyl blocks, sector exponents tracking spectral weights and eigenspace overlaps, an exact minimax argument, and an explicit one-shot measurement construction. Achievability bounds all four probabilities by their target exponentials times 800(n+1)3(d2−1)800(n+1)^{3(d^2-1)}800(n+1)3(d2−1).
The result assumes faithful, finite-dimensional states and positive exponents. For rejection budgets imposed exactly at every blocklength, the same region is established except on K+L=−2log⁡FK+L=-2\log FK+L=−2logF, where the general noncommuting case remains unresolved. The bounds are not second-order asymptotics; extensions to multiple, composite, or correlated hypotheses remain open.
The trade-off between the two types of error probabilities in binary state discrimination may be quantified in the asymptotics by various error exponents. In the composite case, where the hypotheses consist of sets of states, any such exponent is upper bounded by the infimum of the corresponding pairwise exponents of discriminating individual members of the two sets. Attainability of this upper bound may depend on the type of exponents considered; whether the problem is classical or quantum; the cardinality and the geometric properties of the sets representing the hypotheses; and also on the dimensionality of the underlying Hilbert space. Our main contribution is clarifying this landscape considerably. We show that in the quantum case unattainability is the general behaviour for all the exponents, already in finite dimension, for a simple null-hypothesis and an alternative hypothesis consisting of only two states. Moreover, the upper bound may be strict even in the infinite-dimensional classical case if the alternative hypothesis contains at least countably infinitely many states. We also prove general attainability results, e.g., for classical adversarial and arbitrarily varying hypothesis testing, and for the quantum case where all states are pure, or the states commute with every state in the opposite hypothesis.
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)].
The ultimate limits of quantum state discrimination are often thought to be captured by asymptotic bounds that restrict the achievable error probabilities, notably the quantum Chernoff and Hoeffding bounds. Here we study hypothesis testing protocols that are permitted a probability of producing an inconclusive discrimination outcome, and investigate their performance when this probability is suitably constrained. We show that even by allowing an arbitrarily small probability of inconclusiveness, the limits imposed by the quantum Hoeffding and Chernoff bounds can be significantly exceeded. This completely circumvents the conventional trade-offs between error exponents in hypothesis testing while incurring only a vanishingly small overhead over conventional approaches. Such improvements over standard state discrimination are robust and can be obtained even when an exponentially vanishing probability of inconclusive outcomes is demanded. Relaxing the constraints on the inconclusive probability can enable even larger advantages, but this comes at a price. We show a 'strong converse' property of this setting: targeting error exponents beyond those achievable with vanishing inconclusiveness necessarily forces the probability of inconclusive outcomes to converge to one. By exactly quantifying the rate of this convergence, we give a complete characterisation of the trade-offs between error exponents and rates of conclusive outcome probabilities. Overall, our results provide a comprehensive asymptotic picture of how the allowance for inconclusive measurement outcomes reshapes optimal quantum hypothesis testing.
We determine the optimal universal coefficient in a reduction of multiple to binary quantum hypothesis testing. Specifically, for every finite ensemble in any Hilbert space dimension (finite or infinite), we prove that the error probability of the global pretty good measurement (PGM) is at most four times the sum of the optimal binary error probabilities. By constructing a family of regular-simplex ensembles, we further show that the coefficient four is optimal, even for arbitrary global measurements. This result improves on the pairwise bounds established by Cheng and Liu [arXiv:2606.06246 (2026)] and entails an explicit, sharp guarantee for the standard PGM itself. Our proof is also simpler: rather than constructing sequential measurements and applying a union bound, our proof relies on purely matrix-analytic techniques, combining a direct block Gram matrix analysis of the PGM error and a refined inequality between quantum Hellinger distance and Bures χ2χ^2χ2-divergence. Our analysis also yields a refined, one-shot pairwise Chernoff bound and explicit sufficient number of copies for a desired discrimination error.
We study a variant of quantum hypothesis testing wherein an additional ‘inconclusive’ measurement outcome is added, allowing one to abstain from attempting to discriminate the hypotheses. The error probabilities are then conditioned on a successful attempt, with inconclusive trials disregarded. We completely characterise this task in both the single-shot and asymptotic regimes, providing exact formulas for the optimal error probabilities. In particular, we prove that the asymptotic error exponent of discriminating any two quantum states$\rho andandand\sigma isgivenbytheHilbertprojectivemetricis given by the Hilbert projective metricisgivenbytheHilbertprojectivemetricD_{\max }(\rho \|\sigma ) + D_{\max }(\sigma \| \rho )inasymmetrichypothesistesting,andbytheThompsonmetricin asymmetric hypothesis testing, and by the Thompson metricinasymmetrichypothesistesting,andbytheThompsonmetric\max \! \big \{ D_{\max }(\rho \|\sigma ),\, D_{\max }(\sigma \| \rho ) \big \}$in symmetric hypothesis testing. This endows these two quantities with fundamental operational interpretations in quantum state discrimination. Our findings extend to composite hypothesis testing, where we show that the asymmetric error exponent with respect to any convex set of density matrices is given by a regularisation of the Hilbert projective metric. We apply our results also to quantum channels, showing that no advantage is gained by employing adaptive or even more general discrimination schemes over parallel ones, in both the asymmetric and symmetric settings. Our state discrimination results make use of no properties specific to quantum mechanics and are also valid in general probabilistic theories.
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