# The classical capacity achievable by a quantum channel assisted by a limited entanglement

@article{Shor2004TheCC, title={The classical capacity achievable by a quantum channel assisted by a limited entanglement}, author={Peter W. Shor}, journal={Quantum Inf. Comput.}, year={2004}, volume={4}, pages={537-545} }

We give the trade-off curve showing the capacity of a quantum channel as a function of the amount of entanglement used by the sender and receiver for transmitting information. The endpoints of this curve are given by the Holevo-Schumacher-Westmoreland capacity formula and the entanglement-assisted capacity, which is the maximum over all input density matrices of the quantum mutual information. The proof we give is based on the Holevo-Schumacher-Westmoreland formula, and also gives a new and… Expand

#### Topics from this paper

#### Paper Mentions

#### 41 Citations

Permutation Enhances Classical Communication Assisted by Entangled States

- Computer Science, Mathematics
- 2020 IEEE International Symposium on Information Theory (ISIT)
- 2020

It is proved that the difference between the assisted capacity and the Holevo capacity is upper bounded by the discord of formation of the preshared state, and the power of random permutation in classical communication, whenever entanglement assistance is available. Expand

The Capacity of a Quantum Channel for Simultaneous Transmission of Classical and Quantum Information

- Physics, Mathematics
- 2003

An expression is derived characterizing the set of admissible rate pairs for simultaneous transmission of classical and quantum information over a given quantum channel, generalizing both the… Expand

Inequalities for quantum channels assisted by limited resources

- Physics
- 2005

The information capacities and ``distillability'' of a quantum channel are studied in the presence of auxiliary resources. These include prior entanglement shared between the sender and receiver and… Expand

A Survey on Quantum Channel Capacities

- Computer Science, Physics
- IEEE Communications Surveys & Tutorials
- 2018

The properties of the quantum communication channel, the various capacity measures and the fundamental differences between the classical and quantum channels are reviewed. Expand

Entanglement generation with a quantum channel and a shared state

- Mathematics, Physics
- 2010 IEEE International Symposium on Information Theory
- 2010

The channel-state coding protocol paves the way for formulatingEntanglement-assisted quantum error-correcting codes that are robust to noise in shared entanglement and leads to a Smith-Yard superactivation, where it can generate entanglements using a zero-capacity erasure channel and a non-distillable bound entangled state. Expand

TWO-WAY QUANTUM COMMUNICATION CHANNELS

- Computer Science, Physics
- 2006

This work considers communication between two parties using a bipartite quantum operation, which constitutes the most general quantum mechanical model of two-party communication, and gives inner and outer bounds on the achievable rate region that generalize classical results due to Shannon. Expand

A Primer on Quantum Channel Capacity and Its Applications to Optical Communication

- Physics
- 2017

— In this article, we review the capacity of a quantum channel for transmitting classical and quantum information, with our primary focus being the context of optical communication. We discuss the… Expand

On Zero-Error Communication via Quantum Channels in the Presence of Noiseless Feedback

- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2016

An upper bound on the feedback-assisted zero-error capacity is presented, motivated by a conjecture originally made by Shannon and proved later by Ahlswede, and it is demonstrated that this bound to have many good properties, including being additive and given by a minimax formula. Expand

Trading classical communication, quantum communication, and entanglement in quantum Shannon theory

- Mathematics, Physics
- IEEE Transactions on Information Theory
- 2010

A “unit-resource” capacity theorem is proved that applies to the scenario where only the above three noiseless resources are available for consumption or generation, and the optimal strategy mixes the three fundamental protocols of teleportation, superdense coding, and entanglement distribution. Expand

Optimal Trading of Classical Communication, Quantum Communication, and Entanglement

- Mathematics, Computer Science
- TCQ
- 2009

We provide a solution for the most general setting of information processing in the quantum Shannon-theoretic sense by giving optimal trade-offs between classical communication, quantum… Expand

#### References

SHOWING 1-10 OF 22 REFERENCES

Additivity of the classical capacity of entanglement-breaking quantum channels

- Mathematics, Physics
- 2002

We show that for the tensor product of an entanglement-breaking quantum channel with an arbitrary quantum channel, both the minimum entropy of an output of the channel and the… Expand

Entanglement-Assisted Classical Capacity of Noisy Quantum Channels

- Physics
- 1999

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… Expand

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

- Mathematics, Physics
- IEEE Trans. Inf. Theory
- 2002

In the classical analog of entanglement-assisted communication - communication over a discrete memoryless channel (DMC) between parties who share prior random information - one parameter is sufficient, i.e., that in the presence of prior shared random information, all DMCs of equal capacity can simulate one another with unit asymptotic efficiency. Expand

The Capacity of the Quantum Channel with General Signal States

- Physics, 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… Expand

Entanglement-assisted capacity of constrained channels

- Computer Science, Engineering
- Quantum Informatics
- 2003

This paper proves the conjectured formula for the antanglement-assisted capacity of quantum channel with additive input constraint (such as Bosonic Gaussian channel) by proving the coding theorem for classical-quantum constrained channels and a finite dimensional approximation of the input density operators for the entanglement -assisted capacity. Expand

A family of quantum protocols

- Computer Science, Physics
- International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.
- 2004

This paper describes the family of quantum protocols, aNoiseless qubit channel, noiseless classical bit channel and pure ebit (EPR pair) that reflect their classical-quantum and dynamic-static nature. Expand

On entanglement-assisted classical capacity

- Mathematics, Physics
- 2001

We give a modified proof of the recent result of C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V. Thapliyal concerning entanglement-assisted classical capacity of a quantum channel and discuss the… Expand

The capacity of the quantum depolarizing channel

- Physics, Mathematics
- IEEE Trans. Inf. Theory
- 2003

The information-carrying capacity of the d-dimensional depolarizing channel is computed. It is shown that this capacity can be achieved by encoding messages as products of pure states belonging to an… Expand

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

- Computer Science, Physics
- 1999

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

Equivalence of Additivity Questions in Quantum Information Theory

- Mathematics
- 2004

We reduce the number of open additivity problems in quantum information theory by showing that four of them are equivalent. Namely, we show that the conjectures of additivity of the minimum output… Expand