The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Quantum Cost for Sending Entanglement
Open accessAbstract
Establishing quantum entanglement between two distant parties is an essential step of many protocols in quantum information processing. One possibility for providing long-distance entanglement is to create an entangled composite state within a lab and then physically send one subsystem to a distant lab. However, is this the "cheapest" way? Here, we investigate the minimal "cost" that is necessary for establishing a certain amount of entanglement between two distant parties. We prove that this cost is intrinsically quantum, and is specified by quantum correlations. Our results provide an optimal protocol for entanglement distribution and show that quantum correlations are the essential resource for this task.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Experimental Quantum Computing without Entanglement
Lanyon, B. P., Barbieri, M., Almeida, M. P., & White, A. G. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.200501 · Cited by 874
Completely positive maps and entropy inequalities
Lindblad, G. (1975) · Communications in Mathematical Physics · doi:10.1007/bf01609396 · Cited by 666
Cited by
Quantum coherence and correlations in quantum system
Xi, Z., Li, Y., & Fan, H. (2015) · Scientific Reports · doi:10.1038/srep10922 · Cited by 265
Metadata
- Authors
- Streltsov, A., Kampermann, H., & Bruß, D.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2012-06-18
- Volume
- 108
- Issue
- 25
- Pages
- 250501-250501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2016246428
- Cited by
- 164
- References
- 2
- FWCI
- 23.43
- 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: Quantum Cost for Sending Entanglement. https://app.cochat.ai/papers/10.1103/physrevlett.108.250501
- The paper
- Streltsov, A., Kampermann, H., & Bruß, D. (2012). Quantum Cost for Sending Entanglement. Physical Review Letters. https://doi.org/10.1103/physrevlett.108.250501
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.