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

A Generalized quantum Stein lemma on von Neumann algebras

Li Gao

quant-phSubmitted Oct 1, 2026• Announced Oct 2, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks whether the generalized quantum Stein lemma extends from finite-dimensional systems to arbitrary von Neumann algebras. It considers an i.i.d. normal null state $\rho^{\otimes n}$ and composite alternative sets $\mathcal F_n$ that are nonempty, convex, and stable under ordered tensor products. The additional assumption is a reference state $\tau\in\mathcal F_1$ satisfying $C=D(\rho\|\tau)<\infty$, with $D$ the Araki relative entropy. For every fixed type-I error tolerance $\varepsilon\in(0,1)$, the optimal worst-case type-II error exponent equals $R=\lim_n n^{-1}\inf_{\sigma\in\mathcal F_n}D(\rho^{\otimes n}\|\sigma)$. This limit exists by subadditivity and satisfies $0\le R\le C$. Every rate below $R$ is achievable with vanishing type-I error; any test sequence whose worst-case type-II exponent has liminf strictly above $R$ has type-I error tending to one. The proof combines an integral representation of relative entropy through hockey-stick divergences with a modular testing bound. These establish $L^1$ convergence of fixed-block testing profiles to a step function. A convex mixing estimate then yields a sharp composite testing threshold, and minimax converts it into a single test valid against all alternatives. The theorem covers infinite-dimensional $B(H)$ and type-II and type-III algebras without requiring norm-closed alternative sets, permutation invariance, closure under restrictions, faithfulness, or $\sigma$-finiteness. It does not address families lacking a finite-relative-entropy reference; faithfulness alone does not guarantee that condition in infinite dimensions.

Likely largely AI-generatedAI use disclosed
AI assistance was also used for the literature review and for writing, proofreading, and revising the manuscript.

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

Comments
11 pages

Related papers

Quantum Channel Stein's Lemma with an Exponential Strong Converse

Minbo Gao, Zhengfeng Ji, Chenghua Liu

We establish the quantum channel Stein lemma at every fixed type-I error tolerance in $(0,1)$ and prove an exponential strong converse under arbitrary adaptive strategies. For any finite-dimensional channel pair, the optimal type-II exponent equals the regularized channel relative entropy and is attained by parallel strategies. When this divergence is finite, every strictly larger type-II rate forces the probability of accepting the null hypothesis to decay exponentially, uniformly over strategies and quantum memories. The proof rests on a uniform Stinespring approximation: tensor powers of the null dilation are approximated by tensor powers of the alternative dilation after applying an auxiliary linear map to the environment. The operator-norm error is exponentially small under a squared-norm bound at any rate above the regularized relative entropy. We construct the approximation from a weak testing bound by iterative rate reduction and a fixed-block tensor expansion with an exact residual. It implies right continuity at order one of the regularized sandwiched Rényi channel divergence, which yields the adaptive converse through the channel chain rule. We also obtain a sharp hockey-stick threshold and a subchannel smoothing asymptotic equipartition property for fixed and subexponentially vanishing diamond-norm errors.

quant-pharXiv:2609.27196•Sep 24, 2026•4 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

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

Bjarne Bergh, Li Gao, Mizanur Rahaman

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.

quant-pharXiv:2610.00772•Oct 2, 2026•0 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

Quantum Channel Stein Theorem beyond Definite Causal Order

Chengkai Zhu, Xin Wang

Distinguishability is a central concept in information theory and extends naturally to quantum systems. This work shows that, for any two finite-dimensional memoryless quantum channels, parallel, adaptive and general testing strategies achieve the same Stein exponent at every fixed type-I error tolerance $ε\in(0,1)$, namely the regularized channel relative entropy. When this rate is finite, any larger type-II exponent forces the probability of correctly accepting the null hypothesis to decay exponentially. Thus, adaptivity provides no asymptotic advantage. The key step is proving the continuity of the regularized sandwiched Rényi channel divergence at order one. We also derive the exact strong-converse exponent for general testers.

quant-pharXiv:2609.30268•Sep 25, 2026•2 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•7 citations
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 paper asks whether the generalized quantum Stein lemma extends from finite-dimensional systems to arbitrary von Neumann algebras. It considers an i.i.d. normal null state ρ⊗n\rho^{\otimes n}ρ⊗n and composite alternative sets Fn\mathcal F_nFn​ that are nonempty, convex, and stable under ordered tensor products. The additional assumption is a reference state τ∈F1\tau\in\mathcal F_1τ∈F1​ satisfying C=D(ρ∥τ)<∞C=D(\rho\|\tau)<\inftyC=D(ρ∥τ)<∞, with DDD the Araki relative entropy.
For every fixed type-I error tolerance ε∈(0,1)\varepsilon\in(0,1)ε∈(0,1), the optimal worst-case type-II error exponent equals R=lim⁡nn−1inf⁡σ∈FnD(ρ⊗n∥σ)R=\lim_n n^{-1}\inf_{\sigma\in\mathcal F_n}D(\rho^{\otimes n}\|\sigma)R=limn​n−1infσ∈Fn​​D(ρ⊗n∥σ). This limit exists by subadditivity and satisfies 0≤R≤C0\le R\le C0≤R≤C. Every rate below RRR is achievable with vanishing type-I error; any test sequence whose worst-case type-II exponent has liminf strictly above RRR has type-I error tending to one.
The proof combines an integral representation of relative entropy through hockey-stick divergences with a modular testing bound. These establish L1L^1L1 convergence of fixed-block testing profiles to a step function. A convex mixing estimate then yields a sharp composite testing threshold, and minimax converts it into a single test valid against all alternatives.
The theorem covers infinite-dimensional B(H)B(H)B(H) and type-II and type-III algebras without requiring norm-closed alternative sets, permutation invariance, closure under restrictions, faithfulness, or σ\sigmaσ-finiteness. It does not address families lacking a finite-relative-entropy reference; faithfulness alone does not guarantee that condition in infinite dimensions.
We establish the quantum channel Stein lemma at every fixed type-I error tolerance in (0,1)(0,1)(0,1) and prove an exponential strong converse under arbitrary adaptive strategies. For any finite-dimensional channel pair, the optimal type-II exponent equals the regularized channel relative entropy and is attained by parallel strategies. When this divergence is finite, every strictly larger type-II rate forces the probability of accepting the null hypothesis to decay exponentially, uniformly over strategies and quantum memories. The proof rests on a uniform Stinespring approximation: tensor powers of the null dilation are approximated by tensor powers of the alternative dilation after applying an auxiliary linear map to the environment. The operator-norm error is exponentially small under a squared-norm bound at any rate above the regularized relative entropy. We construct the approximation from a weak testing bound by iterative rate reduction and a fixed-block tensor expansion with an exact residual. It implies right continuity at order one of the regularized sandwiched Rényi channel divergence, which yields the adaptive converse through the channel chain rule. We also obtain a sharp hockey-stick threshold and a subchannel smoothing asymptotic equipartition property for fixed and subexponentially vanishing diamond-norm errors.
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.
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 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.
Distinguishability is a central concept in information theory and extends naturally to quantum systems. This work shows that, for any two finite-dimensional memoryless quantum channels, parallel, adaptive and general testing strategies achieve the same Stein exponent at every fixed type-I error tolerance ε∈(0,1)ε\in(0,1)ε∈(0,1), namely the regularized channel relative entropy. When this rate is finite, any larger type-II exponent forces the probability of correctly accepting the null hypothesis to decay exponentially. Thus, adaptivity provides no asymptotic advantage. The key step is proving the continuity of the regularized sandwiched Rényi channel divergence at order one. We also derive the exact strong-converse exponent for general testers.
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.