CoChat

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

Open access
Min-Hsiu Hsieh, Wilde, Mark M · 2010 · IEEE Transactions on Information Theory

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

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.2010.2054532

Cites

55 of 55 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 55 references

Research works printed but not linked: 8

  1. brun, 2006, Catalytic quantum error correction
  2. wilde, 2010, The quantum dynamic capacity formula of a quantum channel
  3. winter, 1999, Coding theorems of quantum information theory
  4. nielsen, 2000, Quantum Computation and Quantum Information
  5. shor, 2004, Quantum Information Statistics Probability (Dedicated to A S Holevo on the Occasion of His 60th Birthday), 144
  6. yard, 2006, Quantum Broadcast Channels
  7. shor, 2002, the quantum channel capacity and coherent information, MSRI Workshop on Quantum Computation
  8. devetak, 2006, The operational meaning of quantum conditional information

Cited by

See all 74

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