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:2008.02461 · Quantum

Bounding the quantum capacity with flagged extensions

Farzad Kianvash, Marco Fanizza, Vittorio Giovannetti

Published Feb 9, 2022• 19 citations
arXivHTMLPDF

Abstract

In this article we consider flagged extensions of convex combination of quantum channels, and find general sufficient conditions for the degradability of the flagged extension. An immediate application is a bound on the quantum Q and private P capacities of any channel being a mixture of a unitary map and another channel, with the probability associated to the unitary component being larger than 1/2 . We then specialize our sufficient conditions to flagged Pauli channels, obtaining a family of upper bounds on quantum and private capacities of Pauli channels. In particular, we establish new state-of-the-art upper bounds on the quantum and private capacities of the depolarizing channel, BB84 channel and generalized amplitude damping channel. Moreover, the flagged construction can be naturally applied to tensor powers of channels with less restricting degradability conditions, suggesting that better upper bounds could be found by considering a larger number of channel uses.

DOI
10.22331/q-2022-02-09-647

Related papers

Pursuing the Fundamental Limits for Quantum Communication

Xin Wang

The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information coherently. In this paper, we derive single-letter upper bounds on the quantum and private capacities of quantum channels. The quantum capacity of a quantum channel is always no larger than the quantum capacity of its extended channels, since the extensions of the channel can be considered as assistance from the environment. By optimizing the parametrized extended channels with specific structures such as the flag structure, we obtain new upper bounds on the quantum capacity of the original quantum channel. Furthermore, we extend our approach to estimating the fundamental limits of private communication and one-way entanglement distillation. As notable applications, we establish improved upper bounds to the quantum and private capacities for fundamental quantum channels of interest in quantum information, some of which are also the sources of noise in superconducting quantum computing. In particular, our upper bounds on the quantum capacities of the depolarizing channel and the generalized amplitude damping channel are strictly better than previously best-known bounds for certain regimes.

arXiv:1912.00931•IEEE Transactions on Information Theory•Mar 24, 2021•24 citations

Quantum Flags and New Bounds on the Quantum Capacity of the Depolarizing Channel

Marco Fanizza, Farzad Kianvash, Vittorio Giovannetti

A new upper bound for the quantum capacity of the d-dimensional depolarizing channels is presented. Our derivation makes use of a flagged extension of the map where the receiver obtains a copy of a state σ_{0} whenever the messages are transmitted without errors, and a copy of a state σ_{1}, when instead the original state gets fully depolarized. By varying the overlap between the flag states, the resulting transformation nicely interpolates between the depolarizing map (when σ_{0}=σ_{1}), and the d-dimensional erasure channel (when σ_{0} and σ_{1} have orthogonal support). We find sufficient conditions for degradability of the flagged channel, which let us calculate its quantum capacity in a suitable parameter region. From this last result we get the upper bound for the depolarizing channel, which by a direct comparison appears to be tighter than previous available results for d>2, and for d=2 it is tighter in an intermediate regime of noise. In particular, in the limit of large d values, our findings present a previously unnoticed O(1) correction.

arXiv:1911.01977•Physical Review Letters•Jul 8, 2020•38 citations

Channel covariance, twirling, contraction and some upper bounds on the quantum capacity

Yingkai Ouyang

Evaluating the quantum capacity of quantum channels is an important but difficult problem, even for channels of low input and output dimension. Smith and Smolin showed that the quantum capacity of the Clifford-twirl of a qubit amplitude damping channel (a qubit depolarizing channel) has a quantum capacity that is at most the coherent information of the qubit amplitude damping channel evaluated on the maximally mixed input state. We restrict our attention to obtaining upper bounds on the quantum capacity using a generalization of Smith and Smolin's degradable extension technique. Given a degradable channel $\cN$ and a finite projective group of unitaries $\cV$, we show that the $\cV$-twirl of $\cN$ has a quantum capacity at most the coherent information of $\cN$ maximized over a $\cV$-contracted space of input states. As a consequence, degradable channels that are covariant with respect to diagonal Pauli matrices have quantum capacities that are their coherent information maximized over just the diagonal input states. As an application of our main result, we supply new upper bounds on the quantum capacity of some unital and non-unital channels -- $d$-dimensional depolarizing channels, two-qubit locally symmetric Pauli channels, and shifted qubit depolarizing channels.

arXiv:1106.2337•Quantum Information and Computation•Sep 1, 2014•27 citations

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

Capacities of the covariant Pauli channel

Abbas Poshtvan, Vahid Karimipour

We study four well-known capacities of a two-parameter family of qubit Pauli channels. These are the channels that are covariant under the $\text{SO}(2)$ group and contain the depolarizing channel as a special case. We find exact expressions for the classical capacity and entanglement-assisted capacities, and analytically determine the regions where the quantum capacity of the channel vanishes. We then use a flag extension to find upper bound for the quantum capacity and private capacity of these channels in the entire region of parameter space and also obtain the lower bound for the quantum capacity by calculating the single-shot quantum capacity numerically. In conjunction with previous results on depolarizing channels, our result is one step forward for determining the capacities of the full Pauli channel.

arXiv:2206.06106•Physical Review A•Dec 8, 2022•7 citations

The Quantum Capacity With Symmetric Side Channels

Graeme Smith, John A. Smolin, Andreas Winter

In this paper, we present an upper bound for the quantum channel capacity that is both additive and convex. Our bound can be interpreted as the capacity of a channel for high-fidelity quantum communication when assisted by a family of channels that have no capacity on their own. This family of assistance channels, which we call symmetric side channels, consists of all channels mapping symmetrically to their output and environment. The bound seems to be quite tight, and for degradable quantum channels, it coincides with the unassisted channel capacity. Using this symmetric side channel capacity, we find new upper bounds on the capacity of the depolarizing channel. We also briefly indicate an analogous notion for distilling entanglement using the same class of (one-way) channels, yielding one of the few entanglement measures that is monotonic under local operations with one-way classical communication (1-LOCC), but not under the more general class of local operations with classical communication (LOCC).

arXiv:quant-ph/0607039•IEEE Transactions on Information Theory•Aug 27, 2008•83 citations
In this article we consider flagged extensions of convex combination of quantum channels, and find general sufficient conditions for the degradability of the flagged extension. An immediate application is a bound on the quantum Q and private P capacities of any channel being a mixture of a unitary map and another channel, with the probability associated to the unitary component being larger than 1/2 . We then specialize our sufficient conditions to flagged Pauli channels, obtaining a family of upper bounds on quantum and private capacities of Pauli channels. In particular, we establish new state-of-the-art upper bounds on the quantum and private capacities of the depolarizing channel, BB84 channel and generalized amplitude damping channel. Moreover, the flagged construction can be naturally applied to tensor powers of channels with less restricting degradability conditions, suggesting that better upper bounds could be found by considering a larger number of channel uses.
The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information coherently. In this paper, we derive single-letter upper bounds on the quantum and private capacities of quantum channels. The quantum capacity of a quantum channel is always no larger than the quantum capacity of its extended channels, since the extensions of the channel can be considered as assistance from the environment. By optimizing the parametrized extended channels with specific structures such as the flag structure, we obtain new upper bounds on the quantum capacity of the original quantum channel. Furthermore, we extend our approach to estimating the fundamental limits of private communication and one-way entanglement distillation. As notable applications, we establish improved upper bounds to the quantum and private capacities for fundamental quantum channels of interest in quantum information, some of which are also the sources of noise in superconducting quantum computing. In particular, our upper bounds on the quantum capacities of the depolarizing channel and the generalized amplitude damping channel are strictly better than previously best-known bounds for certain regimes.
A new upper bound for the quantum capacity of the d-dimensional depolarizing channels is presented. Our derivation makes use of a flagged extension of the map where the receiver obtains a copy of a state σ_{0} whenever the messages are transmitted without errors, and a copy of a state σ_{1}, when instead the original state gets fully depolarized. By varying the overlap between the flag states, the resulting transformation nicely interpolates between the depolarizing map (when σ_{0}=σ_{1}), and the d-dimensional erasure channel (when σ_{0} and σ_{1} have orthogonal support). We find sufficient conditions for degradability of the flagged channel, which let us calculate its quantum capacity in a suitable parameter region. From this last result we get the upper bound for the depolarizing channel, which by a direct comparison appears to be tighter than previous available results for d>2, and for d=2 it is tighter in an intermediate regime of noise. In particular, in the limit of large d values, our findings present a previously unnoticed O(1) correction.
Evaluating the quantum capacity of quantum channels is an important but difficult problem, even for channels of low input and output dimension. Smith and Smolin showed that the quantum capacity of the Clifford-twirl of a qubit amplitude damping channel (a qubit depolarizing channel) has a quantum capacity that is at most the coherent information of the qubit amplitude damping channel evaluated on the maximally mixed input state. We restrict our attention to obtaining upper bounds on the quantum capacity using a generalization of Smith and Smolin's degradable extension technique. Given a degradable channel $\cN$ and a finite projective group of unitaries $\cV$, we show that the $\cV$-twirl of $\cN$ has a quantum capacity at most the coherent information of $\cN$ maximized over a $\cV$-contracted space of input states. As a consequence, degradable channels that are covariant with respect to diagonal Pauli matrices have quantum capacities that are their coherent information maximized over just the diagonal input states. As an application of our main result, we supply new upper bounds on the quantum capacity of some unital and non-unital channels -- ddd-dimensional depolarizing channels, two-qubit locally symmetric Pauli channels, and shifted qubit depolarizing channels.
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.
We study four well-known capacities of a two-parameter family of qubit Pauli channels. These are the channels that are covariant under the SO(2)\text{SO}(2)SO(2) group and contain the depolarizing channel as a special case. We find exact expressions for the classical capacity and entanglement-assisted capacities, and analytically determine the regions where the quantum capacity of the channel vanishes. We then use a flag extension to find upper bound for the quantum capacity and private capacity of these channels in the entire region of parameter space and also obtain the lower bound for the quantum capacity by calculating the single-shot quantum capacity numerically. In conjunction with previous results on depolarizing channels, our result is one step forward for determining the capacities of the full Pauli channel.
In this paper, we present an upper bound for the quantum channel capacity that is both additive and convex. Our bound can be interpreted as the capacity of a channel for high-fidelity quantum communication when assisted by a family of channels that have no capacity on their own. This family of assistance channels, which we call symmetric side channels, consists of all channels mapping symmetrically to their output and environment. The bound seems to be quite tight, and for degradable quantum channels, it coincides with the unassisted channel capacity. Using this symmetric side channel capacity, we find new upper bounds on the capacity of the depolarizing channel. We also briefly indicate an analogous notion for distilling entanglement using the same class of (one-way) channels, yielding one of the few entanglement measures that is monotonic under local operations with one-way classical communication (1-LOCC), but not under the more general class of local operations with classical communication (LOCC).