Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 167

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

System Design for a Long-Line Quantum Repeater

Open access
Van Meter, R., Ladd, T.D., Munro, W.J., Nemoto, K.·2009·IEEE/ACM Transactions on Networking

Abstract

We present a new control algorithm and system design for a network of quantum repeaters, and outline the end-to-end protocol architecture. Such a network will create long-distance quantum states, supporting quantum key distribution as well as distributed quantum computation. Quantum repeaters improve the reduction of quantum-communication throughput with distance from exponential to polynomial. Because a quantum state cannot be copied, a quantum repeater is not a signal amplifier. Rather, it executes algorithms for quantum teleportation in conjunction with a specialized type of quantum error correction calledpurificationto raise thefidelityof the quantum states. We introduce ourbandedpurification scheme, which is especially effective when the fidelity of coupled qubits is low, improving the prospects for experimental realization of such systems. The resulting throughput is calculated via detailed simulations of a long line composed of shorter hops. Our algorithmic improvements increase throughput by a factor of up to 50 compared to earlier approaches, for a broad range of physical characteristics.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tnet.2008.927260

Cites

13 of 13 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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 13 references

Cited by

See all 167

Metadata

Authors
Van Meter, R., Ladd, T. D., Munro, W. J., & Nemoto, K.
Venue
IEEE/ACM Transactions on Networking
Published
2009-06
Volume
17
Issue
3
Pages
1002-1013
ISSN
  • 1063-6692 (ISSN-L)
  • 1558-2566
OpenAlex
W2106789861
Cited by
167
References
13
FWCI
10.07
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: System Design for a Long-Line Quantum Repeater. https://app.cochat.ai/papers/10.1109/tnet.2008.927260
The paper
Van Meter, R., Ladd, T. D., Munro, W. J., & Nemoto, K. (2009). System Design for a Long-Line Quantum Repeater. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/tnet.2008.927260

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.