Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem

  title={Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem},
  author={Charles H. Bennett and Peter W. Shor and John A. Smolin and Ashish V. Thapliyal},
  journal={IEEE Trans. Inf. Theory},
The entanglement-assisted classical capacity of a noisy quantum channel (C/sub E/) is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have access to the resource of shared quantum entanglement, which may be used up by the communication protocol. We show that the capacity C/sub E/ is given by an expression parallel to that for the capacity of a purely classical channel: i.e., the maximum… 

Figures and Tables from this paper

Second-order coding rates for entanglement-assisted communication

It is proved that the Gaussian approximation for a second-order coding rate is achievable for all quantum channels and defines a quantum generalization of the mutual information variance of a channel in the entanglement-assisted setting.

On the second-order asymptotics for entanglement-assisted communication

A quantum generalization of the mutual information variance of a channel in the entanglement-assisted setting is defined and it is shown that this quantity is equal to the channel dispersion and thus completely characterize the convergence toward the entangled classical capacity when the number of channel uses increases.

Entanglement Cost of Quantum Channels

This paper shows how to express theEntanglement cost of a quantum channel as a regularized optimization of the entanglement formation over states that can be generated between sender and receiver and proves security for storage devices for which no results were known before.

Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback

We prove that the classical capacity of an arbitrary quantum channel assisted by a free classical feedback channel is bounded from above by the maximum average output entropy of the quantum channel.

On the gain of entanglement assistance in the classical capacity of quantum Gaussian channels

Quantum channels are trace-preserving completely positive linear maps between Banach spaces of trace-class operators (Schatten classes of order 1); these are noncommutative analogs of Markov

Trade-off capacities of the quantum Hadamard channels

It is shown that the three-dimensional capacity region for entanglement-assisted transmission of classical and quantum information is tractable for the Hadamard class of channels.

One-Shot Entanglement-Assisted Quantum and Classical Communication

Entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise, implies that the difference of two smoothed entropic quantities serves as a one-shot analog of the mutual information in the asymptotic, memoryless scenario.

Entanglement-Assisted Communication of Classical and Quantum Information

The main result is a capacity theorem that gives a 3-D achievable rate region that justifies the need for simultaneous coding of classical and quantum information over an EAQ channel.

Entanglement cost of quantum channels

Here, it is shown that any coding scheme that sends quantum information through a quantum channel at a rate larger than the entanglement cost of the channel has an exponentially small fidelity.

The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels

The amounts of communication and auxiliary resources needed in both the classical and quantum cases, the tradeoffs among them, and the loss of simulation efficiency when auxiliary resources are absent or insufficient are established.




The von Neumann capacity of quantum channels is proposed, which is a quantum-mechanical extension of the Shannon capacity and reverts to it in the classical limit, and an extended Hamming bound is derived that is consistent with that capacity.

Entanglement-Assisted Classical Capacity of Noisy Quantum Channels

It is obtained that exact expressions for the entanglement-assisted capacity of depolarizing and erasure channels in d dimensions are obtained.

Classical information capacity of a quantum channel.

If the sender uses a block coding scheme consisting of a choice of code words that respects the a priori probabilities of the letter states, and the receiver distinguishes whole words rather than individual letters, then the information transmitted can be made arbitrarily close to H and never exceeds H, providing a precise information-theoretic interpretation of von Neumann entropy in quantum mechanics.

Information transmission through a noisy quantum channel

It is shown that different applications may result in different channel capacities, and upper bounds on several of these capacities are proved based on the coherent information, which plays a role in quantum information theory analogous to that played by the mutual information in classical information theory.

Evaluating capacities of bosonic Gaussian channels

We show how to compute or at least to estimate various capacity-related quantities for bosonic Gaussian channels. Among these are the coherent information, the entanglement-assisted classical

The Capacity of the Quantum Channel with General Signal States

  • A. Holevo
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1998
It is shown that the capacity of a classical-quantum channel with arbitrary (possibly mixed) states equals the maximum of the entropy bound with respect to all a priori distributions. This completes

Quantum coding.

  • Schumacher
  • Physics
    Physical review. A, Atomic, molecular, and optical physics
  • 1995
The von Neumann entropy S of the density operator describing an ensemble of pure quantum signal states is equal to the number of spin-1/2 systems (quantum bits or \qubits") necessary to represent the signal faithfully.

Classical Communication Cost of Entanglement Manipulation: Is Entanglement an Interconvertible Resource?

This work constructs an explicit procedure which demonstrates that for bi-partite pure states, in the asymptotic limit, entanglement can be concentrated or diluted with vanishing classical communication cost.

Additivity for unital qubit channels

Additivity of the Holevo capacity is proved for product channels, under the condition that one of the channels is a unital qubit channel, with the other completely arbitrary, and provides an explicit formula for this classical capacity.


We show that no source encoding is needed in the definition of the capacity of a quantum channel for carrying quantum information. This allows us to use the coherent information maximized over all