Trading classical communication, quantum communication, and entanglement in quantum Shannon theory
Open accessThe DOI matches its Crossref record; 55 of the 55 references it cites were found in a registry or an index.
Abstract
In this paper, we give tradeoffs between classical communication, quantum communication, and entanglement for processing information in the Shannon-theoretic setting. We first prove a “unit-resource” capacity theorem that applies to the scenario where only the above three noiseless resources are available for consumption or generation. The optimal strategy mixes the three fundamental protocols of teleportation, superdense coding, and entanglement distribution. We then provide an achievable rate region and a matching multiletter converse for the “direct-static” capacity theorem. This theorem applies to the scenario where a large number of copies of a noisy bipartite state are available (in addition to consumption or generation of the above three noiseless resources). Our coding strategy involves a protocol that we name theclassically assisted state redistribution protocoland the three fundamental protocols. We finally provide an achievable rate region and a matching multiletter converse for the “direct-dynamic” capacity theorem. This theorem applies to the scenario where a large number of uses of a noisy quantum channel are available in addition to the consumption or generation of the three noiseless resources. Our coding strategy combines theclassically enhanced father protocolwith the three fundamental unit protocols.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
Bennett, C. H., & Wiesner, S. J. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2881 · Cited by 5,470
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
Concentrating partial entanglement by local operations
Bennett, C. H., Bernstein, H. J., Popescu, S., & Schumacher, B. (1996) · Physical Review A · doi:10.1103/physreva.53.2046 · Cited by 3,111
The capacity of the quantum channel with general signal states
Holevo, A. S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651037 · Cited by 1,176
Schumacher, B. (1995) · Physical Review A · doi:10.1103/physreva.51.2738 · Cited by 1,090
Sending classical information via noisy quantum channels
Schumacher, B., & Westmoreland, M. D. (1997) · Physical Review A · doi:10.1103/physreva.56.131 · Cited by 1,087
Distillation of secret key and entanglement from quantum states
Devetak, I., & Winter, A. (2005) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2004.1372 · Cited by 877
Research works printed but not linked: 8
- brun, 2006, Catalytic quantum error correction
- wilde, 2010, The quantum dynamic capacity formula of a quantum channel
- winter, 1999, Coding theorems of quantum information theory
- nielsen, 2000, Quantum Computation and Quantum Information
- shor, 2004, Quantum Information Statistics Probability (Dedicated to A S Holevo on the Occasion of His 60th Birthday), 144
- yard, 2006, Quantum Broadcast Channels
- shor, 2002, the quantum channel capacity and coherent information, MSRI Workshop on Quantum Computation
- devetak, 2006, The operational meaning of quantum conditional information
Cited by
Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future
Nawaz, S. J., Sharma, S. K., Wyne, S., Patwary, M. N., & Asaduzzaman, M. (2019) · IEEE Access · doi:10.1109/access.2019.2909490 · Cited by 658
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.1203 · Cited by 330
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2012) · arXiv · doi:10.48550/arxiv.1207.5435 · Cited by 331
(2016) · Quantum Information Theory · doi:10.1017/9781316809976.001 · Cited by 186
Self-citation
Metadata
- Authors
- Hsieh, M.-H., & Wilde, M. M.
- Affiliations
- Japan Science and Technology Agency (JP)
- McGill University (CA)
- Venue
- IEEE Transactions on Information Theory
- Published
- 2010-09
- Volume
- 56
- Issue
- 9
- Pages
- 4705-4730
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2153598200
- Cited by
- 68
- References
- 51
- Citations by year
- 2025: 3 · 2024: 4 · 2023: 4 · 2022: 7 · 2021: 6 · 2020: 10 · 2019: 4 · 2018: 4 · 2017: 3 · 2016: 2 · 2015: 2 · 2014: 3 · 2013: 2 · 2012: 8
- FWCI
- 5.42
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Transactions on Information Theory (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Civil War Book Review (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum Shannon theory, classical communication, quantum communication, entanglement, resource tradeoffs, quantum teleportation, superdense coding, entanglement distribution, noisy quantum channels
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Trading classical communication, quantum communication, and entanglement in quantum Shannon theory. https://app.cochat.ai/papers/10.1109/tit.2010.2054532
- The paper
- Hsieh, M.-H., & Wilde, M. M. (2010). Trading classical communication, quantum communication, and entanglement in quantum Shannon theory. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2010.2054532
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.