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

Dimension-Independent Approximate Additivity and Single-Letter Quantum Capacity Bounds Under Diamond-Norm Perturbations

Ryan Osacra

Published Oct 21, 2026• 0 citations
Publisher

Abstract

Evaluating the quantum capacity $Q(N)$ of a noisy quantum channel is generally intractable due to the superadditivity of coherent information, which necessitates an infinite-letter regularization over tensor powers $N^{\otimes n}$. Building on recent discoveries of non-degradable channels with strictly additive coherent information and the conditional mutual information (CMI) continuity framework of Winter (2016) and Shirokov (2017), we establish an explicit, dimension-independent approximate additivity and single-letter capacity bounding framework for quantum channels in the diamond-norm neighborhood of any strongly additive channel $D$. While the general Alicki-Fannes-Winter-Shirokov (AFWS) CMI method yields a symmetric single-step continuity modulus $f_{\mathrm{WS}}(\epsilon) = 2\epsilon\log_2 d_B + 2g(\epsilon)$ for arbitrary perturbations $\frac{1}{2}\|N - D\|_\diamond \le \epsilon$—already avoiding the $\mathcal{O}(\sqrt{\epsilon}\log(1/\epsilon))$ Stinespring square-root penalty of Leung and Smith (2009)—its orthogonal state decomposition incurs a $2g(\epsilon)$ entropic overhead. Here we prove that for physical convex-mixture noise perturbations $N_\epsilon = (1-\epsilon)D + \epsilon\mathcal{M}$, direct state-level mixture concavity eliminates the orthogonal decomposition, cutting the entropic overhead in half to $h_2(\epsilon)$ ($f_{\mathrm{mix}}(\epsilon) = 2\epsilon\log_2 d_B + h_2(\epsilon)$). Furthermore, when $\mathcal{M}$ is a replacer noise process (such as depolarizing, erasure, or thermal-reset noise), its CMI vanishes identically and the quantum data-processing inequality restricts the linear slope to $d_{\min} := \min(d_A, d_B)$, yielding a strongly asymmetric two-sided bound $-2\epsilon\log_2 d_{\min} - h_2(\epsilon) \le Q^{(1)}(N_\epsilon \otimes M) - Q^{(1)}(D \otimes M) \le h_2(\epsilon)$. Telescoping over $N_\epsilon^{\otimes k} \otimes D^{\otimes (n-k)}$ tightly sandwiches the regularized capacity $Q(N_\epsilon)$ via $Q^{(1)}(N_\epsilon) \le Q(N_\epsilon) \le Q^{(1)}(N_\epsilon) + 2\epsilon\log_2 d_{\min} + 2h_2(\epsilon)$. Numerical benchmarks on depolarizing-perturbed erasure channels confirm that our sharpened bound comes within $1.45\times$ of the exact numerical shift at $\epsilon = 10^{-3}$, improving upon the general Winter-Shirokov CMI bound by nearly $2\times$ and the Leung-Smith Stinespring bound by over $45\times$.

DOI
10.5281/zenodo.23542463

Related papers

Flagged extensions and numerical simulations for quantum channel capacity: bridging theory and computation

Vahid Nourozi

Abstract I will investigate the capacities of noisy quantum channels through a combined analytical and numerical approach. First, I introduce novel flagged extension techniques that embed a channel into a higher-dimensional space, enabling single-letter upper bounds on quantum and private capacities. My results refine previous bounds and clarify noise thresholds beyond which quantum transmission vanishes. Second, I present a simulation framework that uses coherent information to estimate channel capacities in practice, focusing on two canonical examples: the amplitude damping channel (which I confirm is degradable and thus single-letter) and the depolarizing channel (whose capacity requires multi-letter superadditivity). By parameterizing input qubit states on the Bloch sphere, I numerically pinpoint the maximum coherent information for each channel and validate the flagged extension bounds. Notably, I capture the abrupt transition to zero capacity at high noise and observe superadditivity for moderate noise levels.

arXiv:2506.03429•Journal of Physics A Mathematical and Theoretical•Feb 17, 2026•0 citations

Sharp Quantum Capacity Thresholds: Exponential Strong Converses for Degradable and Antidegradable Channels

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

The quantum capacity of a noisy channel quantifies the maximum rate at which quantum information can be transmitted reliably. For general channels, its evaluation requires an optimization over arbitrarily many channel uses. Degradable channels form a central exception: their capacity is given by the single-letter coherent information, while antidegradable channels have zero capacity. Nevertheless, even for these fundamental classes, it has remained open whether communication above capacity becomes possible when a fixed non-maximal error is tolerated. Here we resolve this problem by proving an exponential strong converse for every finite-dimensional degradable and antidegradable channel: at any rate above capacity, the fidelity of every coding scheme decays exponentially with the number of channel uses. As an immediate consequence, we establish the first all-code exponential strong converse for the quantum erasure channel throughout its full parameter range, strengthening previous results that applied only to almost all codes. We also show that exponential strong-converse bounds are preserved under receiver post-processing. This yields efficiently computable semidefinite-programming bounds for arbitrary finite-dimensional channels, improved bounds for Pauli channels, and an exact exponential strong converse for a nondegradable multilevel amplitude-damping family.

quant-pharXiv:2608.01308•Aug 4, 2026•0 citations

Approaches for approximate additivity of the Holevo information of quantum channels

Felix Leditzky, Eneet Kaur, Nilanjana Datta +1 more

We study quantum channels that are close to another channel with weakly additive Holevo information, and we derive upper bounds on their classical capacity. Examples of channels with weakly additive Holevo information are entanglement-breaking channels, unital qubit channels, and Hadamard channels. Related to the method of approximate degradability, we define approximation parameters for each class above, which measure how close an arbitrary channel is to satisfying the respective property. This gives us upper bounds on the classical capacity in terms of functions of the approximation parameters, as well as an outer bound on the dynamic capacity region of a quantum channel. Since these parameters are defined in terms of the diamond distance, the upper bounds can be computed efficiently using semidefinite programming (SDP). We exhibit the usefulness of our method with two example channels: a convex mixture of amplitude damping and depolarizing noise and a composition of amplitude damping and dephasing noise. For both channels, our bounds perform well in certain regimes of the noise parameters in comparison to a recently derived SDP upper bound on the classical capacity. Along the way, we define the notion of a generalized channel divergence (which includes the diamond distance as an example), and we prove that for jointly covariant channels these quantities are maximized by purifications of a state invariant under the covariance group. This latter result may be of independent interest.

arXiv:1709.01111•Physical Review A•Jan 25, 2018•110 citations

Continuity of certain quantum channel divergences

Morgan Jones

The geometric channel fidelity, the geometric Rényi divergences and the Belavkin--Staszewski relative entropy give converse bounds for capacities, discrimination and estimation. Channels are known only approximately, yet two pairs of channels with equal sums can be arbitrarily close in the diamond norm and have fidelities $0$ and $1$. The remedy is the Arveson--Radon--Nikodym derivative $T$ of one map with respect to the sum $Ω$, whose transpose is the environment effect selecting that map in a Stinespring dilation of $Ω$. In $T$, these quantities and all maximal $f$-divergences of operator convex $f$ are continuous, with explicit dimension-free moduli; for two pairs of channels with the same sum the fidelities differ by at most $2\|T_1-T_2\|_\infty^{1/2}$, which gives Hölder continuity in the diamond norm on such splittings. The fidelity is continuous at a pair of completely positive maps exactly when the Choi matrix of the sum is invertible or the fidelity vanishes: noisy channels of full Kraus rank are continuity points, unitary gates are not.

quant-pharXiv:2610.16270•Oct 13, 2026•0 citations

An exponential strong converse for private communication over degradable quantum channels

Mark M. Wilde

We prove an exponential strong converse for the unassisted private capacity of every finite-dimensional degradable quantum channel. We use a single error criterion: the infidelity between the actual message-estimate-environment state and an ideal state consisting of uniformly distributed, perfectly correlated messages that are independent of the environment. At every rate strictly above the channel's maximum coherent information, the optimized fidelity to this ideal state decays exponentially in the number of channel uses. The same bound holds when the ideal environment state is fixed to the actual environment marginal. The proof applies to arbitrary mixed-state encoders and arbitrary collective decoders. Its main operator ingredient is an overlap bound for privacy tests: two receiver placements with a common subsystem of dimension $d_C$ have overlap at most $d_C/M$, where $M$ is the key size, independently of both shield dimensions. We combine this bound with the signed averaging construction presented in arXiv:2608.01308 and a single-filter reduction to symmetric states. A Gaussian filter replaces the common receiver subsystem by a system of controlled dimension from which the original correlations can be approximately recovered using quantum side information. The filter preserves exact exchange symmetry, and a uniform smooth-entropy estimate bounds its output dimension for arbitrary correlated channel inputs. We also obtain an exponential strong converse at zero for antidegradable channels under the same joint criterion and, consequently, for the private capacity of the quantum erasure channel throughout its parameter range.

quant-pharXiv:2609.32515•Sep 29, 2026•0 citations

Tightening Continuity Bounds for Entropies and Bounds on Quantum Capacities

Michael G. Jabbour, Nilanjana Datta

Uniform continuity bounds on entropies are generally expressed in terms of a single distance measure between probability distributions or quantum states, typically, the total variation- or trace distance. However, if an additional distance measure is known, the continuity bounds can be significantly strengthened. Here, we prove a tight uniform continuity bound for the Shannon entropy in terms of both the local- and total variation distances, sharpening an inequality in (Sason, 2013). We also obtain a uniform continuity bound for the von Neumann entropy in terms of both the operator norm- and trace distances. We then apply our results to compute upper bounds on channel capacities. We first refine the concept of approximate degradable channels by introducing$(\varepsilon ,\nu)$–degradable channels. These are$\varepsilon $–close in diamond norm and$\nu $–close in completely bounded spectral norm to their complementary channel when composed with a degrading channel. This leads to improved upper bounds to the quantum- and private classical capacities of such channels. Moreover, these bounds can be further improved by considering certain unstabilized versions of the above norms. We show that upper bounds on the latter can be efficiently expressed as semidefinite programs. As an application, we obtain a new upper bound on the quantum capacity of the qubit depolarizing channel.

arXiv:2310.17329•IEEE Journal on Selected Areas in Information Theory•Jan 1, 2024•3 citations
Evaluating the quantum capacity Q(N)Q(N)Q(N) of a noisy quantum channel is generally intractable due to the superadditivity of coherent information, which necessitates an infinite-letter regularization over tensor powers N⊗nN^{\otimes n}N⊗n. Building on recent discoveries of non-degradable channels with strictly additive coherent information and the conditional mutual information (CMI) continuity framework of Winter (2016) and Shirokov (2017), we establish an explicit, dimension-independent approximate additivity and single-letter capacity bounding framework for quantum channels in the diamond-norm neighborhood of any strongly additive channel DDD. While the general Alicki-Fannes-Winter-Shirokov (AFWS) CMI method yields a symmetric single-step continuity modulus fWS(ϵ)=2ϵlog⁡2dB+2g(ϵ)f_{\mathrm{WS}}(\epsilon) = 2\epsilon\log_2 d_B + 2g(\epsilon)fWS​(ϵ)=2ϵlog2​dB​+2g(ϵ) for arbitrary perturbations 12∥N−D∥⋄≤ϵ\frac{1}{2}\|N - D\|_\diamond \le \epsilon21​∥N−D∥⋄​≤ϵ—already avoiding the O(ϵlog⁡(1/ϵ))\mathcal{O}(\sqrt{\epsilon}\log(1/\epsilon))O(ϵ​log(1/ϵ)) Stinespring square-root penalty of Leung and Smith (2009)—its orthogonal state decomposition incurs a 2g(ϵ)2g(\epsilon)2g(ϵ) entropic overhead. Here we prove that for physical convex-mixture noise perturbations Nϵ=(1−ϵ)D+ϵMN_\epsilon = (1-\epsilon)D + \epsilon\mathcal{M}Nϵ​=(1−ϵ)D+ϵM, direct state-level mixture concavity eliminates the orthogonal decomposition, cutting the entropic overhead in half to h2(ϵ)h_2(\epsilon)h2​(ϵ) (fmix(ϵ)=2ϵlog⁡2dB+h2(ϵ)f_{\mathrm{mix}}(\epsilon) = 2\epsilon\log_2 d_B + h_2(\epsilon)fmix​(ϵ)=2ϵlog2​dB​+h2​(ϵ)). Furthermore, when M\mathcal{M}M is a replacer noise process (such as depolarizing, erasure, or thermal-reset noise), its CMI vanishes identically and the quantum data-processing inequality restricts the linear slope to dmin⁡:=min⁡(dA,dB)d_{\min} := \min(d_A, d_B)dmin​:=min(dA​,dB​), yielding a strongly asymmetric two-sided bound −2ϵlog⁡2dmin⁡−h2(ϵ)≤Q(1)(Nϵ⊗M)−Q(1)(D⊗M)≤h2(ϵ)-2\epsilon\log_2 d_{\min} - h_2(\epsilon) \le Q^{(1)}(N_\epsilon \otimes M) - Q^{(1)}(D \otimes M) \le h_2(\epsilon)−2ϵlog2​dmin​−h2​(ϵ)≤Q(1)(Nϵ​⊗M)−Q(1)(D⊗M)≤h2​(ϵ). Telescoping over Nϵ⊗k⊗D⊗(n−k)N_\epsilon^{\otimes k} \otimes D^{\otimes (n-k)}Nϵ⊗k​⊗D⊗(n−k) tightly sandwiches the regularized capacity Q(Nϵ)Q(N_\epsilon)Q(Nϵ​) via Q(1)(Nϵ)≤Q(Nϵ)≤Q(1)(Nϵ)+2ϵlog⁡2dmin⁡+2h2(ϵ)Q^{(1)}(N_\epsilon) \le Q(N_\epsilon) \le Q^{(1)}(N_\epsilon) + 2\epsilon\log_2 d_{\min} + 2h_2(\epsilon)Q(1)(Nϵ​)≤Q(Nϵ​)≤Q(1)(Nϵ​)+2ϵlog2​dmin​+2h2​(ϵ). Numerical benchmarks on depolarizing-perturbed erasure channels confirm that our sharpened bound comes within 1.45×1.45\times1.45× of the exact numerical shift at ϵ=10−3\epsilon = 10^{-3}ϵ=10−3, improving upon the general Winter-Shirokov CMI bound by nearly 2×2\times2× and the Leung-Smith Stinespring bound by over 45×45\times45×.
Abstract I will investigate the capacities of noisy quantum channels through a combined analytical and numerical approach. First, I introduce novel flagged extension techniques that embed a channel into a higher-dimensional space, enabling single-letter upper bounds on quantum and private capacities. My results refine previous bounds and clarify noise thresholds beyond which quantum transmission vanishes. Second, I present a simulation framework that uses coherent information to estimate channel capacities in practice, focusing on two canonical examples: the amplitude damping channel (which I confirm is degradable and thus single-letter) and the depolarizing channel (whose capacity requires multi-letter superadditivity). By parameterizing input qubit states on the Bloch sphere, I numerically pinpoint the maximum coherent information for each channel and validate the flagged extension bounds. Notably, I capture the abrupt transition to zero capacity at high noise and observe superadditivity for moderate noise levels.
The quantum capacity of a noisy channel quantifies the maximum rate at which quantum information can be transmitted reliably. For general channels, its evaluation requires an optimization over arbitrarily many channel uses. Degradable channels form a central exception: their capacity is given by the single-letter coherent information, while antidegradable channels have zero capacity. Nevertheless, even for these fundamental classes, it has remained open whether communication above capacity becomes possible when a fixed non-maximal error is tolerated. Here we resolve this problem by proving an exponential strong converse for every finite-dimensional degradable and antidegradable channel: at any rate above capacity, the fidelity of every coding scheme decays exponentially with the number of channel uses. As an immediate consequence, we establish the first all-code exponential strong converse for the quantum erasure channel throughout its full parameter range, strengthening previous results that applied only to almost all codes. We also show that exponential strong-converse bounds are preserved under receiver post-processing. This yields efficiently computable semidefinite-programming bounds for arbitrary finite-dimensional channels, improved bounds for Pauli channels, and an exact exponential strong converse for a nondegradable multilevel amplitude-damping family.
We study quantum channels that are close to another channel with weakly additive Holevo information, and we derive upper bounds on their classical capacity. Examples of channels with weakly additive Holevo information are entanglement-breaking channels, unital qubit channels, and Hadamard channels. Related to the method of approximate degradability, we define approximation parameters for each class above, which measure how close an arbitrary channel is to satisfying the respective property. This gives us upper bounds on the classical capacity in terms of functions of the approximation parameters, as well as an outer bound on the dynamic capacity region of a quantum channel. Since these parameters are defined in terms of the diamond distance, the upper bounds can be computed efficiently using semidefinite programming (SDP). We exhibit the usefulness of our method with two example channels: a convex mixture of amplitude damping and depolarizing noise and a composition of amplitude damping and dephasing noise. For both channels, our bounds perform well in certain regimes of the noise parameters in comparison to a recently derived SDP upper bound on the classical capacity. Along the way, we define the notion of a generalized channel divergence (which includes the diamond distance as an example), and we prove that for jointly covariant channels these quantities are maximized by purifications of a state invariant under the covariance group. This latter result may be of independent interest.
The geometric channel fidelity, the geometric Rényi divergences and the Belavkin--Staszewski relative entropy give converse bounds for capacities, discrimination and estimation. Channels are known only approximately, yet two pairs of channels with equal sums can be arbitrarily close in the diamond norm and have fidelities 000 and 111. The remedy is the Arveson--Radon--Nikodym derivative TTT of one map with respect to the sum ΩΩΩ, whose transpose is the environment effect selecting that map in a Stinespring dilation of ΩΩΩ. In TTT, these quantities and all maximal fff-divergences of operator convex fff are continuous, with explicit dimension-free moduli; for two pairs of channels with the same sum the fidelities differ by at most 2∥T1−T2∥∞1/22\|T_1-T_2\|_\infty^{1/2}2∥T1​−T2​∥∞1/2​, which gives Hölder continuity in the diamond norm on such splittings. The fidelity is continuous at a pair of completely positive maps exactly when the Choi matrix of the sum is invertible or the fidelity vanishes: noisy channels of full Kraus rank are continuity points, unitary gates are not.
We prove an exponential strong converse for the unassisted private capacity of every finite-dimensional degradable quantum channel. We use a single error criterion: the infidelity between the actual message-estimate-environment state and an ideal state consisting of uniformly distributed, perfectly correlated messages that are independent of the environment. At every rate strictly above the channel's maximum coherent information, the optimized fidelity to this ideal state decays exponentially in the number of channel uses. The same bound holds when the ideal environment state is fixed to the actual environment marginal. The proof applies to arbitrary mixed-state encoders and arbitrary collective decoders. Its main operator ingredient is an overlap bound for privacy tests: two receiver placements with a common subsystem of dimension dCd_CdC​ have overlap at most dC/Md_C/MdC​/M, where MMM is the key size, independently of both shield dimensions. We combine this bound with the signed averaging construction presented in arXiv:2608.01308 and a single-filter reduction to symmetric states. A Gaussian filter replaces the common receiver subsystem by a system of controlled dimension from which the original correlations can be approximately recovered using quantum side information. The filter preserves exact exchange symmetry, and a uniform smooth-entropy estimate bounds its output dimension for arbitrary correlated channel inputs. We also obtain an exponential strong converse at zero for antidegradable channels under the same joint criterion and, consequently, for the private capacity of the quantum erasure channel throughout its parameter range.
Uniform continuity bounds on entropies are generally expressed in terms of a single distance measure between probability distributions or quantum states, typically, the total variation- or trace distance. However, if an additional distance measure is known, the continuity bounds can be significantly strengthened. Here, we prove a tight uniform continuity bound for the Shannon entropy in terms of both the local- and total variation distances, sharpening an inequality in (Sason, 2013). We also obtain a uniform continuity bound for the von Neumann entropy in terms of both the operator norm- and trace distances. We then apply our results to compute upper bounds on channel capacities. We first refine the concept of approximate degradable channels by introducing(ε,ν)(\varepsilon ,\nu)(ε,ν)–degradable channels. These are$\varepsilon –closeindiamondnormand–close in diamond norm and–closeindiamondnormand\nu $–close in completely bounded spectral norm to their complementary channel when composed with a degrading channel. This leads to improved upper bounds to the quantum- and private classical capacities of such channels. Moreover, these bounds can be further improved by considering certain unstabilized versions of the above norms. We show that upper bounds on the latter can be efficiently expressed as semidefinite programs. As an application, we obtain a new upper bound on the quantum capacity of the qubit depolarizing channel.