CoChat

Entanglement-Assisted Communication of Classical and Quantum Information

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

The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.

Abstract

In this paper, we consider the problem of transmitting classical and quantum information reliably over an entanglement-assisted quantum (EAQ) channel. Our main result is a capacity theorem that gives a 3-D achievable rate region. Points in the region are rate triples, consisting of the classical communication rate, the quantum communication rate, and the entanglement consumption rate of a particular coding scheme. The crucial protocol in achieving the boundary points of the capacity region is a protocol that we name the classically enhanced father(CEF) protocol. The CEF protocol is more general than other protocols in the family tree of quantum Shannon theoretic protocols, in the sense that several previously known quantum protocols are now child protocols of it. The CEF protocol also shows an improvement over a timesharing strategy for the case of a qubit dephasing channel-this result justifies the need for simultaneous coding of classical and quantum information over an EAQ channel. Our capacity theorem is of a multiletter nature (requiring a limit over many uses of the channel), but it reduces to a single-letter characterization for at least three channels: the completely depolarizing channel, the quantum erasure channel, and the qubit dephasing channel.

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

Cites

49 of 49 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

Cited by

See all 112

Metadata

Authors
Hsieh, M.-H., & Wilde, M. M.
Affiliations
  • Japan Science and Technology Agency (JP)
  • Centre for Quantum Technologies (SG)
Venue
IEEE Transactions on Information Theory
Published
2010-09
Volume
56
Issue
9
Pages
4682-4704
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W2127688694
Cited by
112
References
48
Citations by year
2026: 2 · 2025: 2 · 2024: 5 · 2023: 8 · 2022: 9 · 2021: 9 · 2020: 13 · 2019: 9 · 2018: 4 · 2017: 7 · 2016: 3 · 2015: 6 · 2014: 6 · 2013: 6 · 2012: 12
FWCI
8.80
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Information Theory (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Civil War Book Review (submittedVersion)
  • UTS ePRESS (University of Technology Sydney) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Center for Theoretical Sciences
  • Ministère du Développement Économique, de l’Innovation et de l’Exportation
  • National Research Foundation Singapore
  • Ministry of Education - Singapore
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, capacity region, quantum erasure channel, time-sharing, single-letter characterization

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

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.