arXiv:2610.02134
A Generalized quantum Stein lemma on von Neumann algebras
Li Gao
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.
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