Skip to main content
Cornell University
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arxiv logo > quant-ph > arXiv:quant-ph/0106052

Help | Advanced Search

arXiv logo
Cornell University Logo

quick links

  • Login
  • Help Pages
  • About

Quantum Physics

arXiv:quant-ph/0106052 (quant-ph)
[Submitted on 8 Jun 2001 (v1), last revised 14 May 2002 (this version, v2)]

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

Authors:Charles H. Bennett (IBM), Peter W. Shor (AT&T Labs), John A. Smolin (IBM), Ashish V. Thapliyal (UC Santa Barbara)
View a PDF of the paper titled Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem, by Charles H. Bennett (IBM) and 3 other authors
View PDF
Abstract: The entanglement-assisted classical capacity of a noisy quantum channel 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 this capacity is given by an expression parallel to that for the capacity of a purely classical channel: i.e., the maximum, over channel inputs $\rho$, of the entropy of the channel input plus the entropy of the channel output minus their joint entropy, the latter being defined as the entropy of an entangled purification of $\rho$ after half of it has passed through the channel. We calculate entanglement-assisted capacities for two interesting quantum channels, the qubit amplitude damping channel and the bosonic channel with amplification/attenuation and Gaussian noise. We discuss how many independent parameters are required to completely characterize the asymptotic behavior of a general quantum channel, alone or in the presence of ancillary resources such as prior entanglement. In the classical analog of entanglement assisted communication--communication over a discrete memoryless channel (DMC) between parties who share prior random information--we show that one parameter is sufficient, i.e., that in the presence of prior shared random information, all DMC's of equal capacity can simulate one another with unit asymptotic efficiency.
Comments: 42 pages, substantial revision with several corrections and clarifications
Subjects: Quantum Physics (quant-ph)
Cite as: arXiv:quant-ph/0106052
  (or arXiv:quant-ph/0106052v2 for this version)
  https://doi.org/10.48550/arXiv.quant-ph/0106052
arXiv-issued DOI via DataCite

Submission history

From: Peter W. Shor [view email]
[v1] Fri, 8 Jun 2001 21:53:24 UTC (134 KB)
[v2] Tue, 14 May 2002 17:53:49 UTC (126 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem, by Charles H. Bennett (IBM) and 3 other authors
  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2001-06

References & Citations

  • INSPIRE HEP
  • NASA ADS
  • Google Scholar
  • Semantic Scholar

1 blog link

(what is this?)
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack