Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2611.02425

Finite attainment and efficient computation of regularized quantum channel relative entropy

Yiwei Xu, Kun Fang

quant-phcs.ITSubmitted Nov 2, 2026• Announced Nov 3, 2026• 0 citations
arXivHTMLPDF

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$.

Little sign of AI-generated text

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

Related papers

Efficient Approximation of Regularized Relative Entropies and Applications

Kun Fang, Hamza Fawzi, Omar Fawzi

The quantum relative entropy is a fundamental quantity in quantum information science, characterizing the distinguishability between two quantum states. However, this quantity is not additive in general for correlated quantum states, necessitating regularization for precise characterization of the operational tasks of interest. Recently, we proposed the study of the regularized relative entropy between two sequences of sets of quantum states in [arXiv:2411.04035], which captures a general framework for a wide range of quantum information tasks. Here, we show that given suitable structural assumptions and efficient descriptions of the sets, the regularized relative entropy can be efficiently approximated within an additive error by a quantum relative entropy program of polynomial size. This applies in particular to the regularized relative entropy in adversarial quantum channel discrimination. Moreover, we apply the idea of efficient approximation to quantum resource theories. In particular, when the set of interest does not directly satisfy the required structural assumptions, it can be relaxed to one that does. This provides improved and efficient bounds for the entanglement cost of quantum states and channels, entanglement distillation and magic state distillation. Numerical results demonstrate improvements even for the first level of approximation.

arXiv:2502.15659•IEEE Transactions on Information Theory•Feb 6, 2026•10 citations

Continuity of Regularized Channel Rényi Divergences

Jinzhao Wang, Yuxiang Yang

We prove that the regularized, stabilized sandwiched Rényi divergence of finite-dimensional quantum channels converges to their regularized relative entropy as the Rényi order tends to one. The key tool is the channel hockey-stick divergence: Gour's Stinespring approximation bound and a Schatten norm estimate amplify an asymptotic bound below one into exponential decay at higher threshold rates. For channel pairs with finite max-relative entropy, known operational connections then give exponential strong converses for parallel and adaptive discrimination, a sharp zero--one testing law, and the subchannel asymptotic equipartition property.

quant-pharXiv:2609.28635•Sep 25, 2026•1 citation

An Efficient Parameterized Algorithm for Computing Quantum Channel Fidelity via Symmetries Exploitation

Yeow Meng Chee, Hoang Ta, Van Khu Vu

Determining the optimal fidelity for the transmission of quantum information over noisy quantum channels is one of the central problems in quantum information theory. Recently, [Berta-Borderi-Fawzi-Scholz, Mathematical Programming, 2021] introduced an asymptotically converging semidefinite programming hierarchy of outer bounds for this quantity. However, the size of the semidefinite programs (SDPs) grows exponentially with respect to the level of the hierarchy, thus making their computation unscalable. In this work, by exploiting the symmetries in the SDP, we show that, for a fixed output dimension of the quantum channel, we can compute the SDP in time polynomial with respect to the level of the hierarchy and input dimension. As a direct consequence of our result, the optimal fidelity can be approximated with an accuracy of$\epsilon $in$\mathrm {poly}(1/\epsilon, \text {input dimension})$time, compared to the$\exp (1/\epsilon, \text {input dimension})$running time required for direct computation.

arXiv:2308.15884•IEEE Transactions on Information Theory•Jul 16, 2025•5 citations

Multinegativity and single-letter formulas for asymptotic entanglement — E8 Intelligence Research

Andrew Stewart Caldin

The study of entanglement inevitably leads to the concept of regularization, where measures are evaluated on infinitely many copies of a state. Single-letter formulas try to make these asymptotic entanglement quantities accessible through a calculation on one copy of a state, but are rarely available. We introduce a decreasing hierarchy of computable upper bounds on the asymptotic relative entropy of entanglement with respect to positive-partial-transpose (PPT) states. The regularization of every fixed hierarchy level equals this asymptotic quantity. Additivity at any level therefore yields a single-letter formula, even when the usual one-copy relative entropy is nonadditive. We establish such additivity at the first nontrivial level for two broad multiparameter families, both containing all Werner states. The upper-bound construction also extends to sandwiched Renyi divergences. The hierarchy motivates $k$-multinegative states, a generalization of binegative states and the associated Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 7, 2026•0 citations

Multinegativity and single-letter formulas for asymptotic entanglement

Raphael Brinster, Tulja Varun Kondra, Hermann Kampermann +2 more

The study of entanglement inevitably leads to the concept of regularization, where measures are evaluated on infinitely many copies of a state. Single-letter formulas try to make these asymptotic entanglement quantities accessible through a calculation on one copy of a state, but are rarely available. We introduce a decreasing hierarchy of computable upper bounds on the asymptotic relative entropy of entanglement with respect to positive-partial-transpose (PPT) states. The regularization of every fixed hierarchy level equals this asymptotic quantity. Additivity at any level therefore yields a single-letter formula, even when the usual one-copy relative entropy is nonadditive. We establish such additivity at the first nontrivial level for two broad multiparameter families, both containing all Werner states. The upper-bound construction also extends to sandwiched Renyi divergences. The hierarchy motivates $k$-multinegative states, a generalization of binegative states and the associated $k$-multinegativity, which gives explicit upper bounds on both the asymptotic relative entropy and exact PPT entanglement cost. We construct states which are $k$-multinegative at arbitrarily large depths $k$ that separate consecutive levels of the previously introduced entanglement-cost hierarchy, disproving its conjectured finite collapse. These results provide state-dependent single-letter formulas while identifying a limitation of universal finite-level characterizations.

quant-pharXiv:2609.20698•Sep 18, 2026•2 citations

The regularized channel Rényi divergence is continuous

Lukas Schmitt, David Sutter

We show that the regularized channel Rényi divergence is continuous at $α= 1$. As consequences, we establish an exponentially strong converse for channel discrimination, a subchannel-smoothed asymptotic equipartition property, a relative entropy accumulation theorem, and a new proof of the generalized quantum Stein's lemma. Our result further shows that the regularized channel relative entropy is computable. The continuity proof relies on a variational formula that expresses the regularized channel divergence as a single-letter optimization over variables of unrestricted finite dimension. We then establish continuity using a novel spectral confinement technique.

quant-pharXiv:2609.29885•Sep 25, 2026•2 citations
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, O~(ε−3/2)\widetilde O(\varepsilon^{-3/2})O(ε−3/2) channel copies suffice to approximate the regularized value to additive accuracy ε\varepsilonε. Alternatively, a semidefinite hierarchy achieves the same accuracy at level O~(ε−2)\widetilde O(\varepsilon^{-2})O(ε−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.
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(N∥M)<∞D(\mathcal N\|\mathcal M)<\inftyD(N∥M)<∞, it proves a dichotomy: either Dreg=DD^{\mathrm{reg}}=DDreg=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 (Dreg−D)/m(D^{\mathrm{reg}}-D)/m(Dreg−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 JM>0J_{\mathcal M}>0JM​>0, spectral localization gives additive-ε\varepsilonε approximation from below using O~(ε−3/2)\widetilde O(\varepsilon^{-3/2})O(ε−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 O~(ε−2)\widetilde O(\varepsilon^{-2})O(ε−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 Ω(ε−1)\Omega(\varepsilon^{-1})Ω(ε−1) and sufficient O~(ε−3/2)\widetilde O(\varepsilon^{-3/2})O(ε−3/2) bounds for fixed nonadditive pairs with JM>0J_{\mathcal M}>0JM​>0.
The quantum relative entropy is a fundamental quantity in quantum information science, characterizing the distinguishability between two quantum states. However, this quantity is not additive in general for correlated quantum states, necessitating regularization for precise characterization of the operational tasks of interest. Recently, we proposed the study of the regularized relative entropy between two sequences of sets of quantum states in [arXiv:2411.04035], which captures a general framework for a wide range of quantum information tasks. Here, we show that given suitable structural assumptions and efficient descriptions of the sets, the regularized relative entropy can be efficiently approximated within an additive error by a quantum relative entropy program of polynomial size. This applies in particular to the regularized relative entropy in adversarial quantum channel discrimination. Moreover, we apply the idea of efficient approximation to quantum resource theories. In particular, when the set of interest does not directly satisfy the required structural assumptions, it can be relaxed to one that does. This provides improved and efficient bounds for the entanglement cost of quantum states and channels, entanglement distillation and magic state distillation. Numerical results demonstrate improvements even for the first level of approximation.
We prove that the regularized, stabilized sandwiched Rényi divergence of finite-dimensional quantum channels converges to their regularized relative entropy as the Rényi order tends to one. The key tool is the channel hockey-stick divergence: Gour's Stinespring approximation bound and a Schatten norm estimate amplify an asymptotic bound below one into exponential decay at higher threshold rates. For channel pairs with finite max-relative entropy, known operational connections then give exponential strong converses for parallel and adaptive discrimination, a sharp zero--one testing law, and the subchannel asymptotic equipartition property.
Determining the optimal fidelity for the transmission of quantum information over noisy quantum channels is one of the central problems in quantum information theory. Recently, [Berta-Borderi-Fawzi-Scholz, Mathematical Programming, 2021] introduced an asymptotically converging semidefinite programming hierarchy of outer bounds for this quantity. However, the size of the semidefinite programs (SDPs) grows exponentially with respect to the level of the hierarchy, thus making their computation unscalable. In this work, by exploiting the symmetries in the SDP, we show that, for a fixed output dimension of the quantum channel, we can compute the SDP in time polynomial with respect to the level of the hierarchy and input dimension. As a direct consequence of our result, the optimal fidelity can be approximated with an accuracy of$\epsilon ininin\mathrm {poly}(1/\epsilon, \text {input dimension})time,comparedtothetime, compared to thetime,comparedtothe\exp (1/\epsilon, \text {input dimension})$running time required for direct computation.
The study of entanglement inevitably leads to the concept of regularization, where measures are evaluated on infinitely many copies of a state. Single-letter formulas try to make these asymptotic entanglement quantities accessible through a calculation on one copy of a state, but are rarely available. We introduce a decreasing hierarchy of computable upper bounds on the asymptotic relative entropy of entanglement with respect to positive-partial-transpose (PPT) states. The regularization of every fixed hierarchy level equals this asymptotic quantity. Additivity at any level therefore yields a single-letter formula, even when the usual one-copy relative entropy is nonadditive. We establish such additivity at the first nontrivial level for two broad multiparameter families, both containing all Werner states. The upper-bound construction also extends to sandwiched Renyi divergences. The hierarchy motivates kkk-multinegative states, a generalization of binegative states and the associated Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
The study of entanglement inevitably leads to the concept of regularization, where measures are evaluated on infinitely many copies of a state. Single-letter formulas try to make these asymptotic entanglement quantities accessible through a calculation on one copy of a state, but are rarely available. We introduce a decreasing hierarchy of computable upper bounds on the asymptotic relative entropy of entanglement with respect to positive-partial-transpose (PPT) states. The regularization of every fixed hierarchy level equals this asymptotic quantity. Additivity at any level therefore yields a single-letter formula, even when the usual one-copy relative entropy is nonadditive. We establish such additivity at the first nontrivial level for two broad multiparameter families, both containing all Werner states. The upper-bound construction also extends to sandwiched Renyi divergences. The hierarchy motivates kkk-multinegative states, a generalization of binegative states and the associated kkk-multinegativity, which gives explicit upper bounds on both the asymptotic relative entropy and exact PPT entanglement cost. We construct states which are kkk-multinegative at arbitrarily large depths kkk that separate consecutive levels of the previously introduced entanglement-cost hierarchy, disproving its conjectured finite collapse. These results provide state-dependent single-letter formulas while identifying a limitation of universal finite-level characterizations.
We show that the regularized channel Rényi divergence is continuous at α=1α= 1α=1. As consequences, we establish an exponentially strong converse for channel discrimination, a subchannel-smoothed asymptotic equipartition property, a relative entropy accumulation theorem, and a new proof of the generalized quantum Stein's lemma. Our result further shows that the regularized channel relative entropy is computable. The continuity proof relies on a variational formula that expresses the regularized channel divergence as a single-letter optimization over variables of unrestricted finite dimension. We then establish continuity using a novel spectral confinement technique.