Finite attainment and efficient computation of regularized quantum channel relative entropy
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, Õ(ε−3/2) channel copies suffice to approximate the regularized value to additive accuracy ε. Alternatively, a semidefinite hierarchy achieves the same accuracy at level Õ(ε−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.
Related
- Almost-everywhere computation of weak generics relative to r.e. sets
- Efficient computation of mixture confidence sequences in generalized linear models
- Efficient Computation and Congruences for Colored Partition Functions
- Exact Covariance Structure and Efficient Computation for L-Comoments
- Reactive flash for ideal multiphase mixtures: Unified formulation and efficient computation
BibTeX
@misc{xu2026finite,
title = {{Finite attainment and efficient computation of regularized quantum channel relative entropy}},
author = {Yiwei Xu and Kun Fang},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.02425},
eprint = {2611.02425},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.02425},
}
RIS
TY - UNPB
TI - Finite attainment and efficient computation of regularized quantum channel relative entropy
AU - Yiwei Xu
AU - Kun Fang
PY - 2026
DA - 2026/11/02
PB - arXiv
DO - 10.48550/arxiv.2611.02425
UR - https://arxiv.org/abs/2611.02425
AB - 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, Õ(ε^−3/2) channel copies suffice to approximate the regularized value to additive accuracy ε. Alternatively, a semidefinite hierarchy achieves the same accuracy at level Õ(ε^−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.
ER -