A Tight Lower Bound on the Classical Communication Cost of Entanglement Dilution
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Suppose two distant observers, Alice and Bob, share some form of entanglement - quantum correlations - in some bipartite pure quantum states. They may apply local operations and classical communication to convert one form of entanglement to another. Since entanglement is regarded as a resource in quantum information processing, it is an important question to ask how much classical communication, which is also a resource, is needed in the inter-conversion process of entanglement. In this paper, we address this important question in the many-copy case. The inter-conversion process of entanglement is usually divided into two types: concentrating the entanglement from many partially entangled states into a smaller number of maximally entangled states (i.e., singlets) and the reverse process of diluting singlets into partially entangled states. It is known that entanglement concentration requires no classical communication, but the best prior art result for diluting to N copies of a partially entangled state requires an amount of communication on the order of /spl radic/N. Our main result is to prove that this prior art result is optimal up to a constant factor; any procedure for approximately creating N partially entangled states from singlets requires /spl Omega/(/spl radic/N) bits of classical communication. Previously not even a constant bound was known for approximate entanglement transformations. We also prove a lower bound on the inefficiency of the process: to dilute singlets to N copies of a partially entangled state, the entropy of entanglement must decrease by /spl Omega/(/spl radic/N). Moreover, we introduce two new tools - /spl delta/-significant subspaces and the standard form protocol reduction in entanglement manipulations. We hope that these two new tools will be useful in other work in quantum information theory.
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
Quantum Theory: Concepts and Methods
Peres, A., & Ballentine, L. E. (1995) · American Journal of Physics · doi:10.1119/1.17946 · Cited by 2,561
The ‘transition probability’ in the state space of a—algebra
Uhlmann, A. (1976) · Reports on Mathematical Physics · doi:10.1016/0034-4877(76)90060-4 · Cited by 1,649
Conditions for a class of entanglement transformations
Nielsen, M. A. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.436 · Cited by 1,036
Quantum Theory: Concepts and Methods
(2002) · doi:10.1007/0-306-47120-5 · Cited by 1,029
On the role of entanglement in quantum-computational speed-up
Jozsa, R., & Linden, N. (2003) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2002.1097 · Cited by 839 · cited 1×
“For example, many independent copies of any classical random variable with entropy H can be compressed asymptotically losslessly to H bits per copy [5].”
BackgroundVidal, G. (2000) · Journal of Modern Optics · doi:10.1080/09500340008244048 · Cited by 821
A New Proof of the Quantum Noiseless Coding Theorem
Jozsa, R., & Schumacher, B. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552191 · Cited by 304 · cited 2×
“Linden, “On the role of entanglement in quantum computational speed-up,” arXive eprint quantph/0201143 [10] R.”
Background
Cited by
Wilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
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
(2009) · Information Theory · doi:10.1109/9780470544907.ch24 · Cited by 533
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
Chitambar, E., & Gour, G. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.030401 · Cited by 313
Metadata
- Authors
- Harrow, A. W., & Lo, H.-K.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2004-02
- Volume
- 50
- Issue
- 2
- Pages
- 319-327
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2144796586
- Cited by
- 49
- References
- 7
- FWCI
- 3.05
- 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: A Tight Lower Bound on the Classical Communication Cost of Entanglement Dilution. https://app.cochat.ai/papers/10.1109/tit.2003.822597
- The paper
- Harrow, A. W., & Lo, H.-K. (2004). A Tight Lower Bound on the Classical Communication Cost of Entanglement Dilution. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2003.822597
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.