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

Hypothesis testing and Stein's lemma in general probability theories with Euclidean Jordan algebra and its quantum realization

Kanta Sonoda, Hayato Arai, Masahito Hayashi

Published May 5, 2025• 6 citations
arXivHTMLPDF

Abstract

Even though quantum information theory gives advantage over classical information theory, these two information theories have a structural similarity that many exponet rates of information tasks asymptotically equal to entropic quantities. A typical example is Stein's Lemma, which many researchers still keep interested in. In this paper, in order to analyze the mathemtaical roots of the structural similarity, we investigate mathematically minimum structure where Stein's Lemma holds. We focus on the structure of Euclidean Jordan Algebras (EJAs), which is a generalization of the algebraic structure in quantum theory, and we investigate the properties of general models of General Probabilistic Theories (GPTs) generated by EJAs. As a result, we prove Stein's Lemma in any model of GPTs generated by EJAs by establishing a generalization of information theoretical tools from the mathematical properties of EJAs.

DOI
10.48550/arxiv.2505.02487

Related papers

Generalized Stein's lemma and asymptotic equipartition property for subalgebra entropies

Gao, Li, Mizanur Rahaman

The quantum Stein's lemma is a fundamental result of quantum hypothesis testing in the context of distinguishing two quantum states. The ``generalized quantum Stein's lemma'' asserts that this result is true in a general framework where one of the states is replaced by convex sets of quantum states. Formulated in 2008, the generalized Stein's lemma is one of the most influential results in quantum information theory that links resource convertibility to quantum hypothesis testing. However, in 2023 a logical gap was found in the original proof of the generalized Stein's lemma and since then there has been an enormous effort in resolving this issue. In this work, we show that the assertion of the generalized Stein's lemma is true for the setting where the second hypothesis is the state space of any finite-dimensional subalgebra. This is obtained through a strong asymptotic equipartition property for smooth subalgebra entropies that applies to any fixed smoothing parameter. In fact, we obtain a stronger second-order analysis for the hypothesis-testing relative entropy in this setting. As an application in resource theory, we show that the relative entropy of a subalgebra is the asymptotic dilution cost under suitable operations. This provides a possible route to establishing a connection between different quantum resources based on subalgebras. After finishing this article, we learned that there are two independent works (by Hayashi-Yamasaki, and Lami) that finally resolve the generalized Stein's lemma in its full generality. However, we provide an alternative proof in a special case using different operator-algebraic techniques that may be of independent interest.

arXiv:2401.03090•Jan 5, 2024•5 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

Generalised quantum Stein's lemma more robust than ever

Filippo Girardi, Kuan-Yi Lee, Masahito Hayashi +1 more

The generalised quantum Stein's lemma is a key result in quantum hypothesis testing, and connects this fundamental primitive of quantum information processing with quantum resource manipulation, a task that is central for technological applications. Prior works have proved this statement in the idealised setting of independent and identically distributed (i.i.d.) sequences of quantum states, and recent extensions consider also sources that are 'close' to i.i.d., according to the strict notion put forth by Mazzola, Sutter, and Renner. For several applications, however, one would need to consider yet more general sources. We establish a version of the generalised quantum Stein's lemma that is conceptually much simpler and general, as it applies to any source that is asymptotically close to an i.i.d. state with respect to the normalised quantum Wasserstein distance of order 1. As an immediate consequence, we solve the Stein exponent of a scenario where the null hypothesis is arbitrarily varying, expressing it in terms of i.i.d. Stein exponents corresponding to arbitrary states in the convex hull of the null hypothesis base set.

quant-pharXiv:2609.17309•Sep 16, 2026•4 citations

A Solution of the Generalized Quantum Stein’s Lemma

Ludovico Lami

We solve the generalised quantum Stein’s lemma, proving that the Stein exponent associated with entanglement testing, namely, the quantum hypothesis testing task of distinguishing between$\boldsymbol {n}$copies of an entangled state$\boldsymbol {\rho _{AB}}$and a generic separable state$\boldsymbol {\sigma _{A^{n}:B^{n}}}$, equals the regularised relative entropy of entanglement. Not only does this determine the ultimate performance of entanglement testing, but it also establishes the reversibility of all quantum resource theories under asymptotically resource non-generating operations, with the regularised relative entropy of resource governing the asymptotic transformation rate between any two quantum states. As a by-product, we prove that the same Stein exponent can also be achieved when the null hypothesis is only approximately i.i.d., in the sense that it can be modelled by an ‘almost power state’. To solve the problem we introduce two techniques. The first is a procedure that we call ‘blurring’, which, informally, transforms a permutationally symmetric state by making it more evenly spread across nearby type classes. Blurring alone suffices to prove the generalised Stein’s lemma in the fully classical case, but not in the quantum case. Our second technical innovation, therefore, is to perform a second quantisation step to lift the problem to an infinite-dimensional bosonic quantum system; we then solve it there by using techniques from continuous-variable quantum information. Rather remarkably, the second-quantised action of the blurring map corresponds to a pure loss channel. A careful examination of this second quantisation step is the core of our quantum solution.

arXiv:2408.06410•IEEE Transactions on Information Theory•Feb 21, 2025•52 citations

Generalized quantum Stein's lemma for mixed sources

Haruka Kanazawa, Hayata Yamasaki

The generalized quantum Stein's lemma characterizes the optimal asymptotic exponent of the type-II error in quantum hypothesis testing for an independent and identically distributed (IID) null hypothesis against a composite alternative hypothesis. Classically, a probabilistic mixture of IID sources arises as a natural generalization of IID sources, and, in the non-composite setting, the optimal type-II error exponent in hypothesis testing for such classical mixed sources is known to be characterized concisely by the worst-case component of the mixture. In this work, we extend these foundational results to composite quantum hypothesis testing where the null hypothesis is a mixed source, i.e., a probabilistic mixture of IID quantum states, and the alternative hypothesis is composite as in the generalized quantum Stein's lemma. When the type-I error vanishes asymptotically, we characterize the optimal type-II error exponent of this composite quantum hypothesis testing problem in terms of the worst-case component of the mixture, by developing techniques for the non-commutative quantum setting inspired by the classical information-spectrum analysis. We also show that the analogous characterization does not hold in general for a fixed nonzero type-I error threshold, by providing a counterexample beyond the vanishing type-I error regime. These results clarify the applicability of the generalized quantum Stein's lemma to highly non-IID null hypotheses arising from arbitrary finite probabilistic mixtures of IID quantum states.

quant-pharXiv:2605.20776•May 21, 2026•0 citations

On Composite Quantum Hypothesis Testing

Mario Berta, Fernando G. S. L. Brandão, Christoph Hirche

Abstract We extend quantum Stein’s lemma in asymmetric quantum hypothesis testing to composite null and alternative hypotheses. As our main result, we show that the asymptotic error exponent for testing convex combinations of quantum states $$\rho ^{\otimes n}$$ ρ ⊗ n against convex combinations of quantum states $$\sigma ^{\otimes n}$$ σ ⊗ n can be written as a regularized quantum relative entropy formula. We prove that in general such a regularization is needed but also discuss various settings where our formula as well as extensions thereof become single-letter. This includes an operational interpretation of the relative entropy of coherence in terms of hypothesis testing. For our proof, we start from the composite Stein’s lemma for classical probability distributions and lift the result to the non-commutative setting by using elementary properties of quantum entropy. Finally, our findings also imply an improved recoverability lower bound on the conditional quantum mutual information in terms of the regularized quantum relative entropy—featuring an explicit and universal recovery map.

arXiv:1709.07268•Communications in Mathematical Physics•Jun 10, 2021•56 citations
Even though quantum information theory gives advantage over classical information theory, these two information theories have a structural similarity that many exponet rates of information tasks asymptotically equal to entropic quantities. A typical example is Stein's Lemma, which many researchers still keep interested in. In this paper, in order to analyze the mathemtaical roots of the structural similarity, we investigate mathematically minimum structure where Stein's Lemma holds. We focus on the structure of Euclidean Jordan Algebras (EJAs), which is a generalization of the algebraic structure in quantum theory, and we investigate the properties of general models of General Probabilistic Theories (GPTs) generated by EJAs. As a result, we prove Stein's Lemma in any model of GPTs generated by EJAs by establishing a generalization of information theoretical tools from the mathematical properties of EJAs.
The quantum Stein's lemma is a fundamental result of quantum hypothesis testing in the context of distinguishing two quantum states. The ``generalized quantum Stein's lemma'' asserts that this result is true in a general framework where one of the states is replaced by convex sets of quantum states. Formulated in 2008, the generalized Stein's lemma is one of the most influential results in quantum information theory that links resource convertibility to quantum hypothesis testing. However, in 2023 a logical gap was found in the original proof of the generalized Stein's lemma and since then there has been an enormous effort in resolving this issue. In this work, we show that the assertion of the generalized Stein's lemma is true for the setting where the second hypothesis is the state space of any finite-dimensional subalgebra. This is obtained through a strong asymptotic equipartition property for smooth subalgebra entropies that applies to any fixed smoothing parameter. In fact, we obtain a stronger second-order analysis for the hypothesis-testing relative entropy in this setting. As an application in resource theory, we show that the relative entropy of a subalgebra is the asymptotic dilution cost under suitable operations. This provides a possible route to establishing a connection between different quantum resources based on subalgebras. After finishing this article, we learned that there are two independent works (by Hayashi-Yamasaki, and Lami) that finally resolve the generalized Stein's lemma in its full generality. However, we provide an alternative proof in a special case using different operator-algebraic techniques that may be of independent interest.
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.
The generalised quantum Stein's lemma is a key result in quantum hypothesis testing, and connects this fundamental primitive of quantum information processing with quantum resource manipulation, a task that is central for technological applications. Prior works have proved this statement in the idealised setting of independent and identically distributed (i.i.d.) sequences of quantum states, and recent extensions consider also sources that are 'close' to i.i.d., according to the strict notion put forth by Mazzola, Sutter, and Renner. For several applications, however, one would need to consider yet more general sources. We establish a version of the generalised quantum Stein's lemma that is conceptually much simpler and general, as it applies to any source that is asymptotically close to an i.i.d. state with respect to the normalised quantum Wasserstein distance of order 1. As an immediate consequence, we solve the Stein exponent of a scenario where the null hypothesis is arbitrarily varying, expressing it in terms of i.i.d. Stein exponents corresponding to arbitrary states in the convex hull of the null hypothesis base set.
We solve the generalised quantum Stein’s lemma, proving that the Stein exponent associated with entanglement testing, namely, the quantum hypothesis testing task of distinguishing betweenn\boldsymbol {n}ncopies of an entangled stateρAB\boldsymbol {\rho _{AB}}ρAB​and a generic separable stateσAn:Bn\boldsymbol {\sigma _{A^{n}:B^{n}}}σAn:Bn​, equals the regularised relative entropy of entanglement. Not only does this determine the ultimate performance of entanglement testing, but it also establishes the reversibility of all quantum resource theories under asymptotically resource non-generating operations, with the regularised relative entropy of resource governing the asymptotic transformation rate between any two quantum states. As a by-product, we prove that the same Stein exponent can also be achieved when the null hypothesis is only approximately i.i.d., in the sense that it can be modelled by an ‘almost power state’. To solve the problem we introduce two techniques. The first is a procedure that we call ‘blurring’, which, informally, transforms a permutationally symmetric state by making it more evenly spread across nearby type classes. Blurring alone suffices to prove the generalised Stein’s lemma in the fully classical case, but not in the quantum case. Our second technical innovation, therefore, is to perform a second quantisation step to lift the problem to an infinite-dimensional bosonic quantum system; we then solve it there by using techniques from continuous-variable quantum information. Rather remarkably, the second-quantised action of the blurring map corresponds to a pure loss channel. A careful examination of this second quantisation step is the core of our quantum solution.
The generalized quantum Stein's lemma characterizes the optimal asymptotic exponent of the type-II error in quantum hypothesis testing for an independent and identically distributed (IID) null hypothesis against a composite alternative hypothesis. Classically, a probabilistic mixture of IID sources arises as a natural generalization of IID sources, and, in the non-composite setting, the optimal type-II error exponent in hypothesis testing for such classical mixed sources is known to be characterized concisely by the worst-case component of the mixture. In this work, we extend these foundational results to composite quantum hypothesis testing where the null hypothesis is a mixed source, i.e., a probabilistic mixture of IID quantum states, and the alternative hypothesis is composite as in the generalized quantum Stein's lemma. When the type-I error vanishes asymptotically, we characterize the optimal type-II error exponent of this composite quantum hypothesis testing problem in terms of the worst-case component of the mixture, by developing techniques for the non-commutative quantum setting inspired by the classical information-spectrum analysis. We also show that the analogous characterization does not hold in general for a fixed nonzero type-I error threshold, by providing a counterexample beyond the vanishing type-I error regime. These results clarify the applicability of the generalized quantum Stein's lemma to highly non-IID null hypotheses arising from arbitrary finite probabilistic mixtures of IID quantum states.
Abstract We extend quantum Stein’s lemma in asymmetric quantum hypothesis testing to composite null and alternative hypotheses. As our main result, we show that the asymptotic error exponent for testing convex combinations of quantum states ρ⊗n\rho ^{\otimes n}ρ⊗n ρ ⊗ n against convex combinations of quantum states σ⊗n\sigma ^{\otimes n}σ⊗n σ ⊗ n can be written as a regularized quantum relative entropy formula. We prove that in general such a regularization is needed but also discuss various settings where our formula as well as extensions thereof become single-letter. This includes an operational interpretation of the relative entropy of coherence in terms of hypothesis testing. For our proof, we start from the composite Stein’s lemma for classical probability distributions and lift the result to the non-commutative setting by using elementary properties of quantum entropy. Finally, our findings also imply an improved recoverability lower bound on the conditional quantum mutual information in terms of the regularized quantum relative entropy—featuring an explicit and universal recovery map.