Quantum
A Generalized Stein Lemma for Quantum Channels
Publication: quant-ph updates on arXiv.org
Author: Minbo Gao, Zhengfeng Ji, Chenghua Liu
Source published: 28/09/2026, 04:00:00 UTC
Briefing created: 28/09/2026, 04:28:13 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 28/09/2026, 04:13:25 UTC.
Briefings
A new quantum Stein lemma proves optimal type-II error exponents for parallel discrimination of arbitrary finite-dimensional quantum channels against compact, convex alternatives containing faithful replacers. The result establishes that the optimal exponent equals the regularized Umegaki channel relative entropy minimized over these alternatives, with asymptotic equipartition and trace-preserving smoothing at every subexponentially vanishing error. The proof combines uniform auxiliary map approximation, iterative domination reduction, and tensor amplification techniques.
Key points
- The generalized quantum Stein lemma provides the optimal type-II error exponent for parallel discrimination of arbitrary finite-dimensional quantum channels against families of compact, convex alternatives containing a faithful replacer.
- The optimal exponent is defined as the regularized Umegaki channel relative entropy minimized over the alternatives, with both defining limits existing for all fixed type-I error tolerances.
Context and limitations
The proof applies to parallel discrimination of arbitrary finite-dimensional channels; finite-block testing and smoothing formulas are provided only for specific cases involving isometric targets against entanglement-breaking or positive-partial-transpose alternatives.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 28/09/2026, 04:28:13 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeia7s3e3yv4fqpd4eaqie5jup3zjwxnypa67nslob2bi4asikd67ui