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.
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-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.
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 betweenncopies of an entangled stateρABand a generic separable stateσ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 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 establish duality relations for conditional entropies relative to subalgebras of arbitrary von Neumann algebras, including the Umegaki relative entropy as well as the sandwiched- and Petz-Rényi divergences. Even in finite dimensions, these results extend the familiar dualities for conditional entropies from tensor-product subsystems to general subalgebras, while also lifting the framework to the fully infinite-dimensional setting. As an application, we establish an infinite-dimensional extension of quantum Stein's lemma when the alternative hypothesis is the state space of a finite-index subalgebra, which gives an operational interpretation of the relative entropy to a subalgebra as the optimal asymptotic error exponent in composite quantum hypothesis testing-the first beyond finite dimensions.