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

Generalized quantum Stein’s lemma and blurring map

Leonardo Finocchiaro

Published Mar 15, 2026• 0 citations
Publisher

Abstract

A common quantum hypothesis testing task is to decide whether a given state is entangled or not. Given more copies, it is possible to exponentially reduce the chance of making an error. The generalized Stein’s lemma connects this rate of decay to the relative entropy of entanglement of this state. It extends the result in the i.i.d. case, which itself relies on the original classical result from Chernoff and Stein. After a mistake was found in its original proof, the generalized theorem was recently proven independently by Lami and Hayashi. The former developed two new techniques, namely the blurring map and the bosonic lifting procedure, while the latter made use of the pinching inequality. The goal of this report is to present the problem, and build intuition around these tools. After reviewing the proofs, we also consider some possible extensions of the result with the aim to find “one-shot” bounds, effectively bounding the rate of convergence. We finally compare the two rather different approaches from Lami and Hayashi and try to build connections between the tools used in both proofs.

DOI
10.3929/ethz-c-000798688

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•0 citations

Universal quantum resource distillation via composite generalised quantum Stein's lemma

Ludovico Lami, Bartosz Regula, Ryuji Takagi

The performance of quantum resource manipulation protocols, including key examples such as distillation of quantum entanglement, is measured in terms of the rate at which desired target states can be produced from a given noisy state. However, to achieve optimal rates, known protocols require precise tailoring to the quantum state in question, demanding a perfect knowledge of the input and allowing no errors in its preparation. Here we show that distillation of quantum resources in the framework of resource non-generating operations can be performed universally: optimal rates of distillation can be achieved with no knowledge of the input state whatsoever, certifying the robustness of quantum resource distillation. The findings apply in particular to the purification of quantum entanglement under non-entangling maps, where the optimal rates are governed by the regularised relative entropy of entanglement. Our result relies on an extension of the generalised quantum Stein's lemma in quantum hypothesis testing to a composite setting where the null hypothesis is no longer a fixed quantum state, but is rather composed of i.i.d. copies of an unknown state. The solution of this asymptotic problem is made possible through new developments in one-shot quantum information and a refinement of the blurring technique from [Lami, arXiv:2408.06410].

quant-pharXiv:2605.15174•May 15, 2026•0 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•19 citations

Robust generalized quantum Stein's lemma

Giulia Mazzola, David Sutter, Renato Renner

The generalized quantum Stein's lemma provides an explicit expression for the optimal error exponent when distinguishing many independent and identically distributed (iid) copies of a given bipartite state from the set of separable bipartite states. Here we prove that this result is robust, in the sense that the iid assumption can be relaxed to almost-iid. In particular, our result shows that the original argument of Brandão and Plenio, which contains a logical gap, can be made rigorous. Our proof relies on a novel continuity bound for the relative entropy of entanglement with respect to the quantum Wasserstein distance. Combined with a recent insight that almost-iid states and their exact iid counterparts are asymptotically close in this distance, the bound implies that their relative entropies of entanglement coincide asymptotically.

quant-pharXiv:2605.16500•May 19, 2026•0 citations

Sample complexity of quantum resource testing via one-shot quantum blurring

Dmitry Grinko, Ludovico Lami

Quantum resource testing is a fundamental primitive of quantum information processing, profoundly connected to resource manipulation. Its goal is to discriminate $n$ copies of a given resourceful state $ρ$ from all free (i.e., resourceless) states; key instances for applications are entanglement testing and quantum magic testing. The asymptotic characterisation relies on the recently proven Generalised Quantum Stein's Lemma (GQSL), which establishes the rate of decay of the false negative error probability for a fixed false positive error probability. This result, however, is intrinsically asymptotic and thus can provide no finite-resource guarantees, which makes its practical implications unclear. Here, we establish the first rigorous finite-$n$ bounds on quantum resource testing and hence quantum resource manipulation, thus strengthening the GQSL and providing explicit estimates on the number of copies needed to achieve a prescribed performance. As notable consequences, we obtain (a) the convergence of the regularised Rényi relative entropies of a resource, which settles the important open problem from [Fang/Hayashi, arXiv:2508.12901, IEEE ToIT 72:6, 2026]; and (b) the first sample-complexity bound for asymmetric resource testing: for any fixed false positive error probability, a false negative error probability of at most $δ$ can be achieved with $n=O\left(\frac{\log(1/δ)}{D^\infty(ρ\|\mathcal F)}\right)$ copies of $ρ$, in the limit where $δ\to 0$.

quant-pharXiv:2607.24712•Jul 28, 2026•0 citations

A Solution of the Generalised 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$n$copies of an entangled state$\rho_{A B}$and a generic separable state$\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. 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. Longer version [1] at [arXiv:2408.06410].

IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•3 citations
A common quantum hypothesis testing task is to decide whether a given state is entangled or not. Given more copies, it is possible to exponentially reduce the chance of making an error. The generalized Stein’s lemma connects this rate of decay to the relative entropy of entanglement of this state. It extends the result in the i.i.d. case, which itself relies on the original classical result from Chernoff and Stein. After a mistake was found in its original proof, the generalized theorem was recently proven independently by Lami and Hayashi. The former developed two new techniques, namely the blurring map and the bosonic lifting procedure, while the latter made use of the pinching inequality. The goal of this report is to present the problem, and build intuition around these tools. After reviewing the proofs, we also consider some possible extensions of the result with the aim to find “one-shot” bounds, effectively bounding the rate of convergence. We finally compare the two rather different approaches from Lami and Hayashi and try to build connections between the tools used in both proofs.
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.
The performance of quantum resource manipulation protocols, including key examples such as distillation of quantum entanglement, is measured in terms of the rate at which desired target states can be produced from a given noisy state. However, to achieve optimal rates, known protocols require precise tailoring to the quantum state in question, demanding a perfect knowledge of the input and allowing no errors in its preparation. Here we show that distillation of quantum resources in the framework of resource non-generating operations can be performed universally: optimal rates of distillation can be achieved with no knowledge of the input state whatsoever, certifying the robustness of quantum resource distillation. The findings apply in particular to the purification of quantum entanglement under non-entangling maps, where the optimal rates are governed by the regularised relative entropy of entanglement. Our result relies on an extension of the generalised quantum Stein's lemma in quantum hypothesis testing to a composite setting where the null hypothesis is no longer a fixed quantum state, but is rather composed of i.i.d. copies of an unknown state. The solution of this asymptotic problem is made possible through new developments in one-shot quantum information and a refinement of the blurring technique from [Lami, arXiv:2408.06410].
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 provides an explicit expression for the optimal error exponent when distinguishing many independent and identically distributed (iid) copies of a given bipartite state from the set of separable bipartite states. Here we prove that this result is robust, in the sense that the iid assumption can be relaxed to almost-iid. In particular, our result shows that the original argument of Brandão and Plenio, which contains a logical gap, can be made rigorous. Our proof relies on a novel continuity bound for the relative entropy of entanglement with respect to the quantum Wasserstein distance. Combined with a recent insight that almost-iid states and their exact iid counterparts are asymptotically close in this distance, the bound implies that their relative entropies of entanglement coincide asymptotically.
Quantum resource testing is a fundamental primitive of quantum information processing, profoundly connected to resource manipulation. Its goal is to discriminate nnn copies of a given resourceful state ρρρ from all free (i.e., resourceless) states; key instances for applications are entanglement testing and quantum magic testing. The asymptotic characterisation relies on the recently proven Generalised Quantum Stein's Lemma (GQSL), which establishes the rate of decay of the false negative error probability for a fixed false positive error probability. This result, however, is intrinsically asymptotic and thus can provide no finite-resource guarantees, which makes its practical implications unclear. Here, we establish the first rigorous finite-nnn bounds on quantum resource testing and hence quantum resource manipulation, thus strengthening the GQSL and providing explicit estimates on the number of copies needed to achieve a prescribed performance. As notable consequences, we obtain (a) the convergence of the regularised Rényi relative entropies of a resource, which settles the important open problem from [Fang/Hayashi, arXiv:2508.12901, IEEE ToIT 72:6, 2026]; and (b) the first sample-complexity bound for asymmetric resource testing: for any fixed false positive error probability, a false negative error probability of at most δδδ can be achieved with n=O(log⁡(1/δ)D∞(ρ∥F))n=O\left(\frac{\log(1/δ)}{D^\infty(ρ\|\mathcal F)}\right)n=O(D∞(ρ∥F)log(1/δ)​) copies of ρρρ, in the limit where δ→0δ\to 0δ→0.
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 betweennnncopies of an entangled stateρAB\rho_{A B}ρAB​and a generic separable stateσAn:Bn\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. 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. Longer version [1] at [arXiv:2408.06410].