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.00772

Conditioning on Subalgebras - Entropy Duality and Generalized Quantum Stein's Lemma in von Neumann Algebras

Bjarne Bergh, Li Gao, Mizanur Rahaman

quant-phmath-phmath.OASubmitted Sep 30, 2026• Announced Oct 2, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks whether conditional-entropy duality extends from tensor-product subsystems to general subalgebras, and whether this yields composite hypothesis-testing results beyond finite dimensions. It considers inclusions $\mathcal N\subseteq\mathcal M$ of arbitrary von Neumann algebras equipped with a normal faithful conditional expectation $E$ of finite index. For sandwiched Rényi divergences, it proves $\widetilde D_\alpha(\rho|_{\mathcal M}\|E_*\mathcal S(\mathcal N))=-\widetilde D_\beta(\rho|_{\mathcal N'}\|E^{-1}_*\mathcal S(\mathcal M'))$, where $1/\alpha+1/\beta=2$ and $\alpha,\beta\in[1/2,\infty]$. Here the commutant states come from a vector representative of $\rho$, and $E^{-1}$ is Haagerup’s dual operator-valued weight. It also establishes an unoptimized Petz-Rényi duality for $\alpha+\beta=2$, with orders in $[0,2]$, and relative-entropy dualities. For scalar index, normalizing $E^{-1}$ gives additive identities with correction $\log\operatorname{Ind}E$; ordinary subsystem conditioning recovers $2\log d_A$. The application is a generalized quantum Stein lemma and asymptotic equipartition property: for every fixed $\varepsilon\in(0,1)$, both the hypothesis-testing and smoothed max-relative entropies per copy converge to the single-letter quantity $D(\rho\|\rho\circ E)$. Alternatives include all correlated $E^{\otimes n}$-invariant normal states. The proofs combine spatial derivatives, Haagerup’s identity, a minimax exchange, smoothed duality, and an existing single-state equipartition theorem. The results require finite index, not merely infinite-dimensional subalgebra structure, and do not establish Stein’s lemma for arbitrary convex alternatives. For symmetry examples, the alternatives use independent group actions on copies, rather than a diagonal collective action.

Little sign of AI-generated textAI use disclosedStrong assumptions
Additionally, Claude Fable 5.1 was used to add explanations, improve the exposition of the paper, and write out some of the standard arguments used in the Appendix.

Error found: The abstract omits the finite-index and normal-faithfulness hypotheses under which the paper establishes its entropy dualities. The introductory finite-dimensional duality theorem needs a faithfulness hypothesis: singular multiplicity states τ_j do not support its stated inverse-weight construction, and pseudoinversion can make the claimed equality false.

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

Comments
67 pages, no figures

Related papers

A Generalized quantum Stein lemma on von Neumann algebras

Li Gao

We prove a generalized quantum Stein lemma for i.i.d. normal states against convex, tensor-stable families on arbitrary von Neumann algebras. Assuming the existence of an alternative state with finite relative entropy from the null state, we show that, at every type-I error tolerance $\varepsilon\in (0,1)$, the worst case type-II error exponent is achieved with the regularized relative entropy with a strong converse. The proof combines the integral representation of relative entropy by hockey-stick divergences, a modular testing bound, and convex minimax argument.

quant-pharXiv:2610.02134•Oct 2, 2026•1 citation

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

A Generalized Stein Lemma for Quantum Channels

Minbo Gao, Zhengfeng Ji, Chenghua Liu

We prove a generalized quantum Stein lemma for parallel discrimination of an arbitrary finite-dimensional channel against families of alternative channels. The alternatives are compact and convex, closed under tensor products, and contain a faithful replacer. At every fixed type-I error tolerance, the optimal type-II error exponent equals the regularized Umegaki channel relative entropy minimized over the alternatives, and both defining limits exist. Inputs may be entangled across channel uses and with a reference system. The main technical result constructs exactly trace-preserving approximations with exponentially small diamond error, dominated in completely positive order by free channels at every rate above the common exponent. The proof combines uniform auxiliary map approximation, iterative reduction of the domination rate, and tensor amplification. It yields asymptotic equipartition with trace-preserving smoothing at every subexponentially vanishing error, an exponential strong converse, and stability under vanishing diamond-norm perturbations. Under additional permutation invariance and closure under insertion of a fixed faithful input state and discarding of its output, we also prove an explicit finite-block completion bound. This quantitative construction uses weighted discarding, local operator corrections, and comparison with auxiliary extensions. Applications include state-preserving, coherence-restricted, covariant, entanglement-breaking, and positive-partial-transpose channels. For isometric targets against entanglement-breaking or positive-partial-transpose alternatives, we obtain exact finite-block testing and smoothing formulas.

quant-pharXiv:2609.30762•Sep 28, 2026•1 citation

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

Operational interpretation of the reverse sandwiched Renyi divergences in composite quantum hypothesis testing

Masahito Hayashi, Kun Fang

We study the Hoeffding regime of composite quantum hypothesis testing, in which each hypothesis is specified by a sequence of sets of quantum states. We establish quantum Hoeffding bounds under a set of structural assumptions, orthogonal to those of our previous framework. A notable consequence is the direct operational interpretation of the reverse sandwiched Renyi divergence for $α\in (0,1)$: for the task of discriminating a thermal equilibrium state from a probe state subject to unknown dephasing in the energy eigenbasis, with free Hamiltonian evolution as a special case, the optimal Hoeffding exponent is given exactly by this divergence evaluated on a single copy of the system. The same task in the Stein regime is governed by the reverse quantum relative entropy, providing its operational interpretation as well. This behavior contrasts both with the simple independent and identically distributed (i.i.d.) setting, where the Petz Renyi divergence and the Umegaki relative entropy govern the Hoeffding and Stein exponents, respectively, and with many composite settings, where only regularized many-copy formulas are available. This finding reveals that passing from simple to composite hypotheses can fundamentally change which quantum divergence determines the operational limits of discrimination, and suggests a new avenue for seeking operational interpretations of quantum divergences by lifting simple hypotheses to richer composite scenarios.

quant-pharXiv:2605.02203•May 5, 2026•5 citations

Strong converse rate for asymptotic hypothesis testing in type III

Marius Junge, Nicholas D. LaRacuente

We extend from the hyperfinite setting to general von Neumann algebras Mosonyi and Ogawa's (2015) and Mosonyi and Hiai's (2023) results showing the operational interpretation of sandwiched relative Rényi entropy in the strong converse of hypothesis testing. The specific task is to distinguish between two quantum states given many copies. We use a reduction method of Haagerup, Junge, and Xu (2010) to approximate relative entropy inequalities in an arbitrary von Neumann algebra by those in finite von Neumann algebras. Within these finite von Neumann algebras, it is possible to approximate densities via finite spectrum operators, after which the quantum method of types reduces them to effectively commuting subalgebras. Generalizing beyond the hyperfinite setting shows that the operational meaning of sandwiched Rényi entropy is not restricted to the matrices but is a more fundamental property of quantum information. Furthermore, applicability in general von Neumann algebras opens potential new connections to random matrix theory and the quantum information theory of fundamental physics.

arXiv:2507.07989•Jul 10, 2025•3 citations
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.
The paper asks whether conditional-entropy duality extends from tensor-product subsystems to general subalgebras, and whether this yields composite hypothesis-testing results beyond finite dimensions. It considers inclusions N⊆M\mathcal N\subseteq\mathcal MN⊆M of arbitrary von Neumann algebras equipped with a normal faithful conditional expectation EEE of finite index.
For sandwiched Rényi divergences, it proves D~α(ρ∣M∥E∗S(N))=−D~β(ρ∣N′∥E∗−1S(M′))\widetilde D_\alpha(\rho|_{\mathcal M}\|E_*\mathcal S(\mathcal N))=-\widetilde D_\beta(\rho|_{\mathcal N'}\|E^{-1}_*\mathcal S(\mathcal M'))Dα​(ρ∣M​∥E∗​S(N))=−Dβ​(ρ∣N′​∥E∗−1​S(M′)), where 1/α+1/β=21/\alpha+1/\beta=21/α+1/β=2 and α,β∈[1/2,∞]\alpha,\beta\in[1/2,\infty]α,β∈[1/2,∞]. Here the commutant states come from a vector representative of ρ\rhoρ, and E−1E^{-1}E−1 is Haagerup’s dual operator-valued weight. It also establishes an unoptimized Petz-Rényi duality for α+β=2\alpha+\beta=2α+β=2, with orders in [0,2][0,2][0,2], and relative-entropy dualities. For scalar index, normalizing E−1E^{-1}E−1 gives additive identities with correction log⁡Ind⁡E\log\operatorname{Ind}ElogIndE; ordinary subsystem conditioning recovers 2log⁡dA2\log d_A2logdA​.
The application is a generalized quantum Stein lemma and asymptotic equipartition property: for every fixed ε∈(0,1)\varepsilon\in(0,1)ε∈(0,1), both the hypothesis-testing and smoothed max-relative entropies per copy converge to the single-letter quantity D(ρ∥ρ∘E)D(\rho\|\rho\circ E)D(ρ∥ρ∘E). Alternatives include all correlated E⊗nE^{\otimes n}E⊗n-invariant normal states.
The proofs combine spatial derivatives, Haagerup’s identity, a minimax exchange, smoothed duality, and an existing single-state equipartition theorem. The results require finite index, not merely infinite-dimensional subalgebra structure, and do not establish Stein’s lemma for arbitrary convex alternatives. For symmetry examples, the alternatives use independent group actions on copies, rather than a diagonal collective action.
We prove a generalized quantum Stein lemma for i.i.d. normal states against convex, tensor-stable families on arbitrary von Neumann algebras. Assuming the existence of an alternative state with finite relative entropy from the null state, we show that, at every type-I error tolerance ε∈(0,1)\varepsilon\in (0,1)ε∈(0,1), the worst case type-II error exponent is achieved with the regularized relative entropy with a strong converse. The proof combines the integral representation of relative entropy by hockey-stick divergences, a modular testing bound, and convex minimax argument.
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.
We prove a generalized quantum Stein lemma for parallel discrimination of an arbitrary finite-dimensional channel against families of alternative channels. The alternatives are compact and convex, closed under tensor products, and contain a faithful replacer. At every fixed type-I error tolerance, the optimal type-II error exponent equals the regularized Umegaki channel relative entropy minimized over the alternatives, and both defining limits exist. Inputs may be entangled across channel uses and with a reference system. The main technical result constructs exactly trace-preserving approximations with exponentially small diamond error, dominated in completely positive order by free channels at every rate above the common exponent. The proof combines uniform auxiliary map approximation, iterative reduction of the domination rate, and tensor amplification. It yields asymptotic equipartition with trace-preserving smoothing at every subexponentially vanishing error, an exponential strong converse, and stability under vanishing diamond-norm perturbations. Under additional permutation invariance and closure under insertion of a fixed faithful input state and discarding of its output, we also prove an explicit finite-block completion bound. This quantitative construction uses weighted discarding, local operator corrections, and comparison with auxiliary extensions. Applications include state-preserving, coherence-restricted, covariant, entanglement-breaking, and positive-partial-transpose channels. For isometric targets against entanglement-breaking or positive-partial-transpose alternatives, we obtain exact finite-block testing and smoothing formulas.
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.
We study the Hoeffding regime of composite quantum hypothesis testing, in which each hypothesis is specified by a sequence of sets of quantum states. We establish quantum Hoeffding bounds under a set of structural assumptions, orthogonal to those of our previous framework. A notable consequence is the direct operational interpretation of the reverse sandwiched Renyi divergence for α∈(0,1)α\in (0,1)α∈(0,1): for the task of discriminating a thermal equilibrium state from a probe state subject to unknown dephasing in the energy eigenbasis, with free Hamiltonian evolution as a special case, the optimal Hoeffding exponent is given exactly by this divergence evaluated on a single copy of the system. The same task in the Stein regime is governed by the reverse quantum relative entropy, providing its operational interpretation as well. This behavior contrasts both with the simple independent and identically distributed (i.i.d.) setting, where the Petz Renyi divergence and the Umegaki relative entropy govern the Hoeffding and Stein exponents, respectively, and with many composite settings, where only regularized many-copy formulas are available. This finding reveals that passing from simple to composite hypotheses can fundamentally change which quantum divergence determines the operational limits of discrimination, and suggests a new avenue for seeking operational interpretations of quantum divergences by lifting simple hypotheses to richer composite scenarios.
We extend from the hyperfinite setting to general von Neumann algebras Mosonyi and Ogawa's (2015) and Mosonyi and Hiai's (2023) results showing the operational interpretation of sandwiched relative Rényi entropy in the strong converse of hypothesis testing. The specific task is to distinguish between two quantum states given many copies. We use a reduction method of Haagerup, Junge, and Xu (2010) to approximate relative entropy inequalities in an arbitrary von Neumann algebra by those in finite von Neumann algebras. Within these finite von Neumann algebras, it is possible to approximate densities via finite spectrum operators, after which the quantum method of types reduces them to effectively commuting subalgebras. Generalizing beyond the hyperfinite setting shows that the operational meaning of sandwiched Rényi entropy is not restricted to the matrices but is a more fundamental property of quantum information. Furthermore, applicability in general von Neumann algebras opens potential new connections to random matrix theory and the quantum information theory of fundamental physics.