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:quant-ph/9701015 · Physical Review Letters

Capacities of Quantum Erasure Channels

Charles H. Bennett, David Peter Divincenzo, John A. Smolin

Published Apr 21, 1997• 377 citations
arXivHTMLPDF

Abstract

The quantum analog of the classical erasure channel provides a simple example of a channel whose asymptotic capacity for faithful transmission of intact quantum states, with and without the assistance of a two-way classical side channel, can be computed exactly. We derive the quantum and classical capacities for the quantum erasure channel and related channels, and compare them to the depolarizing channel, for which only upper and lower bounds on the capacities are known.

DOI
10.1103/physrevlett.78.3217

Related papers

Capacity of Quantum Erasure Channel Assisted by Backwards Classical Communication

Debbie Leung, Joungkeun Lim, Peter W. Shor

We present a communication protocol for the erasure channel assisted by backward classical communication, which achieves a significantly better rate than the best prior result. In addition, we prove an upper bound for the capacity of the channel. The upper bound is smaller than the capacity of the erasure channel when it is assisted by two-way classical communication. Thus, we prove the separation between quantum capacities assisted by backward classical communication and two-way classical communication.

arXiv:0710.5943•Physical Review Letters•Dec 11, 2009•10 citations

The n-shot classical capacity of the quantum erasure channel

Matteo Rosati

Abstract We compute the n-shot classical capacity of the quantum erasure channel, providing upper bounds and almost-matching lower bounds for it, the latter achievable via large-minimum-distance classical linear codes for any n. The protocols are in full product form, i.e. no entanglement is needed either at the encoder or decoder to attain the capacity, and they explicitly adapt to the transition between different error regimes as the erasure probability increases. Finally, we show that our upper and lower bounds on the capacity are tighter than those obtainable from the general theory of finite-size capacity via generalized divergences.

Journal of Physics Communications•Aug 1, 2024•2 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

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

Entanglement-Assisted Classical Capacity of Noisy Quantum Channels

Charles H. Bennett, Peter W. Shor, John A. Smolin +1 more

Prior entanglement between sender and receiver, which exactly doubles the classical capacity of a noiseless quantum channel, can increase the classical capacity of some noisy quantum channels by an arbitrarily large constant factor depending on the channel, relative to the best known classical capacity achievable without entanglement. The enhancement factor is greatest for very noisy channels, with positive classical capacity but zero quantum capacity. We obtain exact expressions for the entanglement-assisted capacity of depolarizing and erasure channels in $d$ dimensions.

arXiv:quant-ph/9904023•Physical Review Letters•Oct 11, 1999•616 citations

The quantum capacity with symmetric side channels

Graeme Smith, John A. Smolin, Andreas Winter

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 oneway classical communication (1-LOCC), but not under the more general class of local operations with classical communication (LOCC).

•Jul 5, 2006•60 citations
The quantum analog of the classical erasure channel provides a simple example of a channel whose asymptotic capacity for faithful transmission of intact quantum states, with and without the assistance of a two-way classical side channel, can be computed exactly. We derive the quantum and classical capacities for the quantum erasure channel and related channels, and compare them to the depolarizing channel, for which only upper and lower bounds on the capacities are known.
We present a communication protocol for the erasure channel assisted by backward classical communication, which achieves a significantly better rate than the best prior result. In addition, we prove an upper bound for the capacity of the channel. The upper bound is smaller than the capacity of the erasure channel when it is assisted by two-way classical communication. Thus, we prove the separation between quantum capacities assisted by backward classical communication and two-way classical communication.
Abstract We compute the n-shot classical capacity of the quantum erasure channel, providing upper bounds and almost-matching lower bounds for it, the latter achievable via large-minimum-distance classical linear codes for any n. The protocols are in full product form, i.e. no entanglement is needed either at the encoder or decoder to attain the capacity, and they explicitly adapt to the transition between different error regimes as the erasure probability increases. Finally, we show that our upper and lower bounds on the capacity are tighter than those obtainable from the general theory of finite-size capacity via generalized divergences.
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.
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).
Prior entanglement between sender and receiver, which exactly doubles the classical capacity of a noiseless quantum channel, can increase the classical capacity of some noisy quantum channels by an arbitrarily large constant factor depending on the channel, relative to the best known classical capacity achievable without entanglement. The enhancement factor is greatest for very noisy channels, with positive classical capacity but zero quantum capacity. We obtain exact expressions for the entanglement-assisted capacity of depolarizing and erasure channels in ddd dimensions.
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 oneway classical communication (1-LOCC), but not under the more general class of local operations with classical communication (LOCC).