arXiv:2611.02425
Finite attainment and efficient computation of regularized quantum channel relative entropy
Yiwei Xu, Kun Fang
Abstract
Quantum channel relative entropy can be nonadditive, making its regularization essential for asymptotic analysis. We study when the regularized value is attained at finite blocklength and how efficiently it can be approximated. For the first question, we establish a sharp dichotomy: the regularized value is either attained already at the single-copy level, implying additivity at every blocklength, or is never attained at any finite blocklength. Notably, a simple two-copy additivity test distinguishes between these alternatives for qubit channels and for channel pairs in arbitrary dimensions admitting an interior optimizer. We further show that both the interiority condition and finite nonattainment are generic, holding for almost every channel pair. For the second question, we establish explicit convergence rates for approximating the regularized channel relative entropy. For fixed channel dimensions, $\widetilde O(\varepsilon^{-3/2})$ channel copies suffice to approximate the regularized value to additive accuracy $\varepsilon$. Alternatively, a semidefinite hierarchy achieves the same accuracy at level $\widetilde O(\varepsilon^{-2})$, yielding a certified polynomial-time approximation. Together, these results reveal the intriguing structure and generic behavior of regularized channel relative entropy, sharpening our understanding of both its analytical and computational aspects.
AI Summary
The paper asks when regularized Umegaki channel relative entropy is attained at finite blocklength and how efficiently it can be approximated. For finite-dimensional channel pairs with $D(\mathcal N\|\mathcal M)<\infty$, it proves a dichotomy: either $D^{\mathrm{reg}}=D$ and every blocklength is additive, or no finite block attains the regularized value. A channel-relative-entropy chain rule also yields a finite-block gap of at least $(D^{\mathrm{reg}}-D)/m$. Two-copy additivity characterizes one-copy attainment for qubit-to-qubit channels and, in arbitrary dimensions, whenever an optimal pure input has full-rank reference marginal. The latter criterion is established through a modular-flow invariance condition, a two-copy Bregman identity, and tensorization; boundary perturbations handle qubit rank-deficient optimizers. Algebraic genericity arguments show that almost every channel pair has a unique full-rank optimizer at every blocklength and strictly superadditive divergence for every pair of positive blocklengths, hence finite nonattainment. Assuming $J_{\mathcal M}>0$, spectral localization gives additive-$\varepsilon$ approximation from below using $\widetilde O(\varepsilon^{-3/2})$ channel copies. Quantitative continuity of regularized sandwiched Rényi divergences, combined with a symmetry-reduced sharp-Rényi SDP hierarchy, gives certified approximation at level $\widetilde O(\varepsilon^{-2})$, polynomial-time for fixed channel dimensions. The stated approximation orders assume a fixed positive Choi spectral lower bound; polynomial-time computation is not claimed uniformly in dimension. No universal finite-copy additivity test exists in higher dimensions: positive-definite Choi pairs can remain additive through any prescribed finite blocklength before becoming nonadditive. The optimal convergence rate remains open between the necessary $\Omega(\varepsilon^{-1})$ and sufficient $\widetilde O(\varepsilon^{-3/2})$ bounds for fixed nonadditive pairs with $J_{\mathcal M}>0$.
Error found: The abstract advertises finite-block and efficient certified approximation without stating that the proved guarantees require a positive-definite Choi matrix for the second channel, with the advertised accuracy scalings taken at a fixed positive spectral lower bound.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- comments are welcome