CoChat

Optimal Quantum Source Coding With Quantum Side Information at the Encoder and Decoder

Open access
Yard, Jon T., Devetak, Igor · 2009 · IEEE Transactions on Information Theory
Cited by 116

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

Abstract

Consider many instances of an arbitrary quadripartite pure state of four quantum systems ABCD. Alice holds the AC part of each state, Bob holds B, while R represents all other parties correlated with ABC . Alice is required to redistribute the C systems to Bob while asymptotically preserving the overall purity. We prove that this is possible using Q qubits of communication and E ebits of shared entanglement between Alice and Bob, provided that Q ges 1/2I(C; D|B) and Q + E ges H(C|B), proving the optimality of the Luo-Devetak outer bound. The optimal qubit rate provides the first known operational interpretation of quantum conditional mutual information. We also show how our protocol leads to a fully operational proof of strong subaddivity and uncover a general organizing principle, in analogy to thermodynamics, that underlies the optimal rates.

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

Cites

3 of 3 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 3 references

Cited by

See all 116

Metadata

Authors
Yard, J. T., & Devetak, I.
Venue
IEEE Transactions on Information Theory
Published
2009-11
Volume
55
Issue
11
Pages
5339-5351
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W2106308393
Cited by
116
References
3
FWCI
5.06
Type
journal article
Language
en
Open access
green

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: Optimal Quantum Source Coding With Quantum Side Information at the Encoder and Decoder. https://app.cochat.ai/papers/10.1109/tit.2009.2030494
The paper
Yard, J. T., & Devetak, I. (2009). Optimal Quantum Source Coding With Quantum Side Information at the Encoder and Decoder. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2009.2030494

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.