arXiv:2609.27196
Quantum Channel Stein's Lemma with an Exponential Strong Converse
Minbo Gao, Zhengfeng Ji, Chenghua Liu
Abstract
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.
AI Summary
The paper addresses the fixed-error Stein threshold for discriminating arbitrary finite-dimensional quantum channels, allowing entangled inputs and adaptive strategies with unrestricted finite-dimensional quantum memories. Earlier weak-converse results identified the regularized channel relative entropy $d=D^\infty(\mathcal N\Vert\mathcal M)$, but did not establish that it remains the threshold at every fixed type-I error tolerance. It proves that, for every $0<\varepsilon<1$, the optimal parallel and adaptive type-II error exponents both converge to $d$. Parallel strategies repeating a suitable fixed input block achieve every rate below $d$. When $d<\infty$, every rate $R>d$ admits a strategy-independent constant $c_R>0$ such that $q\le2^{-nR}$ implies null acceptance probability $p\le2^{-nc_R}$ for all adaptive tests. If $d=\infty$, parallel tests attain zero type-II error at sufficiently large blocklengths. The central construction approximates the null channel’s tensor-power Stinespring dilation by applying one linear map to the alternative environment. At any squared-norm rate $S>d$, the operator-norm error decays exponentially, uniformly over inputs and references. Semidefinite testing duality, iterative tensor truncation, and a fixed-block expansion with an exact residual establish this approximation. It yields right continuity at order one of the regularized sandwiched Rényi channel divergence; an existing chain rule then supplies the adaptive converse. Consequences include a sharp hockey-stick threshold and a diamond-norm subchannel-smoothing asymptotic equipartition property. The construction does not optimize the rate-gap dependence of the error exponent. No critical-rate hockey-stick limit is established, and the smoothing result permits trace loss rather than requiring trace-preserving approximants.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 24 pages