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

Non-Asymptotic Bounds via the Nussbaum-Szkoła Mapping for Quantum Hypothesis Testing

Jorge Lizarribar-Carrillo, Gonzalo Vazquez-Vilar, Tobias Koch

quant-phSubmitted Oct 29, 2026• Announced Oct 30, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum hypothesis testing concerns the discrimination between quantum states. This paper introduces novel lower and upper bounds for asymmetric quantum hypothesis testing based on the Nussbaum-Szkoła mapping. Together, these bounds provide a unified recovery of both converse and achievability results across all major asymptotic regimes, including large-, moderate-, and small-deviations. Unlike existing bounds, which either rely on technically involved information-spectrum arguments or suffer from fixed prefactors and limited applicability in the non-asymptotic regime, the proposed bounds arise from a unified framework and enable, in some cases, the direct use of classical results. It is further demonstrated that these bounds provide accurate approximations to the optimal quantum error trade-off function at small blocklengths. Numerical comparisons with existing bounds, including those based on fidelity and information spectrum methods, highlight their improved tightness.

AI Summary

The paper studies non-asymptotic bounds on the optimal type-II error $\beta_\alpha(\rho,\sigma)$ under a type-I error constraint $\alpha$, using the classical Nussbaum–Szkoła distributions $P,Q$ associated with the states’ spectral decompositions. Its main general converse is $\beta_\alpha(\rho,\sigma)\ge s\,\beta_{\alpha/(1-s)}(P,Q)$ for $0\le s<1$ and $\alpha\le1-s$. The proof combines the variational characterization of the quantum testing trade-off with a weighted Cauchy–Schwarz inequality. Together with the existing achievability bound $\beta_\alpha(\rho,\sigma)\le s^{-1}\beta_{(1-s)\alpha}(P,Q)$, this gives a classical–quantum comparison with adjustable error rescalings and prefactors. The converse is shown to be asymptotically tight for nearly orthogonal pure states. When $\rho$ is pure, a stronger achievability bound is established: $\beta_\alpha(\rho,\sigma)\le s_1^{-1}\beta_{s_2\alpha}(P,Q)$, with $s_1\le1$ for $s_2\le1/2$ and $s_1\le4s_2(1-s_2)$ otherwise. A rank-one perturbation analysis yields this region and a sharp universal factor $4/3$ comparing the quantum weighted minimum with its Nussbaum–Szkoła counterpart in the pure–mixed setting. Choosing blocklength-dependent parameters recovers known second-order asymptotics with $O(\log n)$ remainder, moderate-deviation expansions, and Hoeffding exponents from classical results. Numerical comparisons use five-copy qubit examples. The paper notes that existing harmonic-mean bounds are tighter in the mixed–mixed examples and recover the exact third-order term, whereas the proposed bounds emphasize analytic tractability. The improved achievability bound requires a pure null state; the asymptotic analysis assumes $\operatorname{supp}(\rho)\subseteq\operatorname{supp}(\sigma)$.

Some signs of AI-generated textIncrementalPossible errorUnclear writing

Error found: The moderate-deviations converse incorrectly substitutes the signed third cumulant for the absolute third central moment required by Rozovsky's lemma, invalidating that application as written. The printed Tomamichel–Hayashi achievability benchmark gives an upper bound of 1/4 when rho=sigma=I/2 and alpha=1/4, despite the exact optimum being 3/4. The appendix reverses both comparisons between 4s2(1−s2) and 2s2, although correcting the branch analysis recovers the parameter region stated in Lemma 3.

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

Related papers

A Converse Bound via the Nussbaum-Szkoła Mapping for Quantum Hypothesis Testing

Jorge Lizarribar-Carrillo, Gonzalo Vazquez-Vilar, Tobias Koch

Quantum hypothesis testing concerns the discrimination between quantum states. This paper introduces a novel lower bound for asymmetric quantum hypothesis testing that is based on the Nussbaum-Szkoła mapping. The lower bound provides a unified recovery of converse results across all major asymptotic regimes, including large-, moderate-, and small-deviations. Unlike existing bounds, which either rely on technically involved information-spectrum arguments or suffer from fixed prefactors and limited applicability in the non-asymptotic regime, the proposed bound arises from a single expression and enables, in some cases, the direct use of classical results. It is further demonstrated that the proposed bound provides accurate approximations to the optimal quantum error trade-off function at small blocklengths. Numerical comparisons with existing bounds, including those based on fidelity and information spectrum methods, highlight its improved tightness.

quant-pharXiv:2601.13970•IEEE International Symposium on Information Theory (ISIT)•Jan 21, 2026•3 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

The Converse Part of The Theorem for Quantum Hoeffding Bound

Hiroshi Nagaoka

We prove the converse part of the theorem for quantum Hoeffding bound on the asymptotics of quantum hypothesis testing, essentially based on an argument developed by Nussbaum and Szkola in proving the converse part of the quantum Chernoff bound. Our result complements Hayashi's proof of the direct (achievability) part of the theorem, so that the quantum Hoeffding bound has now been established.

arXiv:quant-ph/0611289•Nov 30, 2006•133 citations

Multiple quantum hypothesis testing expressions and classical-quantum channel converse bounds

Gonzalo Vazquez-Vilar

Alternative exact expressions are derived for the minimum error probability of a hypothesis test discriminating among M quantum states. The first expression corresponds to the error probability of a binary hypothesis test with certain parameters; the second involves the optimization of a given information-spectrum measure. Particularized in the classical-quantum channel coding setting, this characterization implies the tightness of two existing converse bounds; one derived by Matthews and Wehner using hypothesis-testing, and one obtained by Hayashi and Nagaoka via an information-spectrum approach.

arXiv:1607.07625•IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2016•7 citations

From asymptotic hypothesis testing to entropy inequalities

Christoph Hirche

This thesis addresses the interplay between asymptotic hypothesis testing and entropy inequalities in quantum information theory. In the first part of the thesis we focus on hypothesis testing. We consider two main settings; one can either fix quantum states while optimizing over measurements or fix a measurement and evaluate its capability to discriminate by optimizing over states. In the former setting, we prove a composite quantum Stein's Lemma. We also discuss how this gives an operational interpretation to several quantities of interest. For the latter, we give the optimal asymptotic error rates in several symmetric and asymmetric settings, and discuss properties and examples of these rates. In the second part, the focus is shifted to entropy inequalities. We start with recoverability inequalities. Using tools developed to prove the composite Stein's Lemma, we give a strengthened lower bound on the conditional quantum mutual information (CQMI). Next, we give an operational interpretation to the relative entropy of recovery via hypothesis testing. Then, we discuss some recent counterexamples, which show that the relative entropy of recovery is not a lower bound on the CQMI; we provide more counterexamples where some systems are classical. We then turn to a seemingly different type of entropy inequalities called bounds on information combining. Using a particular recoverability inequality, we give a lower bound and additionally conjecture optimal lower and upper bounds. Furthermore, we discuss implications of our bounds to the finite blocklength behavior of Polar codes. Finally, we discuss Renyi-$2$ entropy inequalities for Gaussian states, by exploiting their formulation as log-det inequalities to find recoverability related bounds on several quantities. We apply this to Gaussian steerability and entanglement measures, proving their monogamy and several other features.

arXiv:1812.05142•Dec 12, 2018•4 citations

Asymptotic Error Rates in Quantum Hypothesis Testing

K. M. R. Audenaert, M. Nussbaum, Arleta Szkoła +1 more

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.

arXiv:0708.4282•Communications in Mathematical Physics•Feb 7, 2008•288 citations
Quantum hypothesis testing concerns the discrimination between quantum states. This paper introduces novel lower and upper bounds for asymmetric quantum hypothesis testing based on the Nussbaum-Szkoła mapping. Together, these bounds provide a unified recovery of both converse and achievability results across all major asymptotic regimes, including large-, moderate-, and small-deviations. Unlike existing bounds, which either rely on technically involved information-spectrum arguments or suffer from fixed prefactors and limited applicability in the non-asymptotic regime, the proposed bounds arise from a unified framework and enable, in some cases, the direct use of classical results. It is further demonstrated that these bounds provide accurate approximations to the optimal quantum error trade-off function at small blocklengths. Numerical comparisons with existing bounds, including those based on fidelity and information spectrum methods, highlight their improved tightness.
The paper studies non-asymptotic bounds on the optimal type-II error βα(ρ,σ)\beta_\alpha(\rho,\sigma)βα​(ρ,σ) under a type-I error constraint α\alphaα, using the classical Nussbaum–Szkoła distributions P,QP,QP,Q associated with the states’ spectral decompositions.
Its main general converse is βα(ρ,σ)≥s βα/(1−s)(P,Q)\beta_\alpha(\rho,\sigma)\ge s\,\beta_{\alpha/(1-s)}(P,Q)βα​(ρ,σ)≥sβα/(1−s)​(P,Q) for 0≤s<10\le s<10≤s<1 and α≤1−s\alpha\le1-sα≤1−s. The proof combines the variational characterization of the quantum testing trade-off with a weighted Cauchy–Schwarz inequality. Together with the existing achievability bound βα(ρ,σ)≤s−1β(1−s)α(P,Q)\beta_\alpha(\rho,\sigma)\le s^{-1}\beta_{(1-s)\alpha}(P,Q)βα​(ρ,σ)≤s−1β(1−s)α​(P,Q), this gives a classical–quantum comparison with adjustable error rescalings and prefactors. The converse is shown to be asymptotically tight for nearly orthogonal pure states.
When ρ\rhoρ is pure, a stronger achievability bound is established: βα(ρ,σ)≤s1−1βs2α(P,Q)\beta_\alpha(\rho,\sigma)\le s_1^{-1}\beta_{s_2\alpha}(P,Q)βα​(ρ,σ)≤s1−1​βs2​α​(P,Q), with s1≤1s_1\le1s1​≤1 for s2≤1/2s_2\le1/2s2​≤1/2 and s1≤4s2(1−s2)s_1\le4s_2(1-s_2)s1​≤4s2​(1−s2​) otherwise. A rank-one perturbation analysis yields this region and a sharp universal factor 4/34/34/3 comparing the quantum weighted minimum with its Nussbaum–Szkoła counterpart in the pure–mixed setting.
Choosing blocklength-dependent parameters recovers known second-order asymptotics with O(log⁡n)O(\log n)O(logn) remainder, moderate-deviation expansions, and Hoeffding exponents from classical results. Numerical comparisons use five-copy qubit examples. The paper notes that existing harmonic-mean bounds are tighter in the mixed–mixed examples and recover the exact third-order term, whereas the proposed bounds emphasize analytic tractability. The improved achievability bound requires a pure null state; the asymptotic analysis assumes supp⁡(ρ)⊆supp⁡(σ)\operatorname{supp}(\rho)\subseteq\operatorname{supp}(\sigma)supp(ρ)⊆supp(σ).
Quantum hypothesis testing concerns the discrimination between quantum states. This paper introduces a novel lower bound for asymmetric quantum hypothesis testing that is based on the Nussbaum-Szkoła mapping. The lower bound provides a unified recovery of converse results across all major asymptotic regimes, including large-, moderate-, and small-deviations. Unlike existing bounds, which either rely on technically involved information-spectrum arguments or suffer from fixed prefactors and limited applicability in the non-asymptotic regime, the proposed bound arises from a single expression and enables, in some cases, the direct use of classical results. It is further demonstrated that the proposed bound provides accurate approximations to the optimal quantum error trade-off function at small blocklengths. Numerical comparisons with existing bounds, including those based on fidelity and information spectrum methods, highlight its improved tightness.
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)].
Alternative exact expressions are derived for the minimum error probability of a hypothesis test discriminating among M quantum states. The first expression corresponds to the error probability of a binary hypothesis test with certain parameters; the second involves the optimization of a given information-spectrum measure. Particularized in the classical-quantum channel coding setting, this characterization implies the tightness of two existing converse bounds; one derived by Matthews and Wehner using hypothesis-testing, and one obtained by Hayashi and Nagaoka via an information-spectrum approach.
This thesis addresses the interplay between asymptotic hypothesis testing and entropy inequalities in quantum information theory. In the first part of the thesis we focus on hypothesis testing. We consider two main settings; one can either fix quantum states while optimizing over measurements or fix a measurement and evaluate its capability to discriminate by optimizing over states. In the former setting, we prove a composite quantum Stein's Lemma. We also discuss how this gives an operational interpretation to several quantities of interest. For the latter, we give the optimal asymptotic error rates in several symmetric and asymmetric settings, and discuss properties and examples of these rates. In the second part, the focus is shifted to entropy inequalities. We start with recoverability inequalities. Using tools developed to prove the composite Stein's Lemma, we give a strengthened lower bound on the conditional quantum mutual information (CQMI). Next, we give an operational interpretation to the relative entropy of recovery via hypothesis testing. Then, we discuss some recent counterexamples, which show that the relative entropy of recovery is not a lower bound on the CQMI; we provide more counterexamples where some systems are classical. We then turn to a seemingly different type of entropy inequalities called bounds on information combining. Using a particular recoverability inequality, we give a lower bound and additionally conjecture optimal lower and upper bounds. Furthermore, we discuss implications of our bounds to the finite blocklength behavior of Polar codes. Finally, we discuss Renyi-222 entropy inequalities for Gaussian states, by exploiting their formulation as log-det inequalities to find recoverability related bounds on several quantities. We apply this to Gaussian steerability and entanglement measures, proving their monogamy and several other features.
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.