Quantum repeaters with imperfect memories: Cost and scalability
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Memory dephasing and its impact on the rate of entanglement generation in quantum repeaters is addressed. For systems that rely on probabilistic schemes for entanglement distribution and connection, we estimate the maximum achievable rate per employed memory for our optimized partial nesting protocol, when a large number of memories are being used in each node. The above rate scales polynomially with distance, $L$, if quantum memories with infinitely long coherence times are available or if we employ a fully fault-tolerant scheme. For memories with finite coherence times and no fault-tolerant protection, the above rate optimistically degrades exponentially in $\sqrt{L}$, regardless of the employed purification scheme. It decays, at best, exponentially in $L$ if no purification is used.
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 cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
Quantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication
Briegel, H.-J., Dür, W., Cirac, J. I., & Zoller, P. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.5932 · Cited by 3,481
Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy Channels
Deutsch, D., Ekert, A., Jozsa, R., Macchiavello, C., Popescu, S., & Sanpera, A. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.2818 · Cited by 1,268
Fast and robust approach to long-distance quantum communication with atomic ensembles
Jiang, L., Taylor, J. M., & Lukin, M. D. (2007) · Physical Review A · doi:10.1103/physreva.76.012301 · Cited by 132
Cited by
Advances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
Self-citationRemote quantum entanglement between two micromechanical oscillators
Riedinger, R., Wallucks, A., Marinković, I., Löschnauer, C., Aspelmeyer, M., Hong, S., & Gröblacher, S. (2018) · Nature · doi:10.1038/s41586-018-0036-z · Cited by 607
All-photonic quantum repeaters
Azuma, K., Tamaki, K., & Lo, H.-K. (2015) · Nature Communications · doi:10.1038/ncomms7787 · Cited by 583
Quantum repeaters: From quantum networks to the quantum internet
Azuma, K., Economou, S. E., Elkouss, D., Hilaire, P., Jiang, L., Lo, H.-K., & Tzitrin, I. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045006 · Cited by 559
Munro, W. J., Azuma, K., Tamaki, K., & Nemoto, K. (2015) · IEEE Journal of Selected Topics in Quantum Electronics · doi:10.1109/jstqe.2015.2392076 · Cited by 365
Metadata
- Authors
- Razavi, M., Piani, M., & Lütkenhaus, N.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2009-09-01
- Volume
- 80
- Issue
- 3
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2043137390
- Cited by
- 123
- References
- 5
- FWCI
- 4.34
- 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
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.