Optimal Quantum Source Coding With Quantum Side Information at the Encoder and Decoder
Open accessThe 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.
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
Proof of the strong subadditivity of quantum-mechanical entropy
Lieb, E. H., & Ruskai, M. B. (1973) · Journal of Mathematical Physics · doi:10.1063/1.1666274 · Cited by 831
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
Bennett, C. H., Shor, P. W., Smolin, J. A., & Thapliyal, A. V. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.802612 · Cited by 698
Negative Entropy and Information in Quantum Mechanics
Cerf, N. J., & Adami, C. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.5194 · Cited by 461
Cited by
Wilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
(2009) · Information Theory · doi:10.1109/9780470544907.ch24 · Cited by 533
Entanglement-Assisted Communication of Classical and Quantum Information
Hsieh, M.-H., & Wilde, M. M. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2053903 · Cited by 112
“This method of efficiently coding classical and quantum information is the “piggybacking” technique introduced in [7] and applied again in [25] and [29].”
MethodTrading classical communication, quantum communication, and entanglement in quantum Shannon theory
Hsieh, M.-H., & Wilde, M. M. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054532 · Cited by 68
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.