Cited by 268Quantum Information and CryptographyQuantum Computing Algorithms and ArchitectureQuantum optics and atomic interactions

Repeat-Until-Success Linear Optics Distributed Quantum Computing

Open access
Lim, Yuan Liang, Beige, Almut, Kwek, Leong Chuan·2005·Physical Review Letters

Abstract

We demonstrate the possibility to perform distributed quantum computing using only single-photon sources (atom-cavity-like systems), linear optics, and photon detectors. The qubits are encoded in stable ground states of the sources. To implement a universal two-qubit gate, two photons should be generated simultaneously and pass through a linear optics network, where a measurement is performed on them. Gate operations can be repeated until a success is heralded without destroying the qubits at any stage of the operation. In contrast with other schemes, this does not require explicit qubit-qubit interactions, a priori entangled ancillas, nor the feeding of photons into photon sources.

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.1103/physrevlett.95.030505

Cites

31 of 31 references verified0 citation errors · 0 not checkable

Statistics

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Due to the non-deterministic nature of entangling gates, the one-way model is the most natural approach to scalable quantum computation in hybrid optical-matter schemes.

    “Due to the non-deterministic nature of the entangling gates, the one-way model is, again, the most natural approach to scalable quantum computation either via non-deterministic strategies 39,53 , repeat-until-success strategies 52 or so-called 'broker-client' approaches 54 .”

    From Measurement-based quantum computation (2009) · cites this paper as [52]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. [14]I. E. Protsenko, G. Reymond, N. Schlosser, and P. Grangier, Phys. Rev. A 66 , 062306 (2002); N. Schlosser, I. Protsenko, and P. Grangier, Phil. Trans. Roy. Soc. Lond. A 361 , 1527 (2003).
  2. [21]W. K. Wootters and B. D. Fields, Annals of Physics 191 , 363 (1989).

Cited by

Sorted by citations

Authors
Lim, Y. L., Beige, A., & Kwek, L. C.
Affiliations
  • Imperial College London (GB)
  • University of Cambridge (GB)
  • National University of Singapore (SG)
Venue
Physical Review Letters
Published
2005-07-13
Volume
95
Issue
3
Pages
030505-030505
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W1990395475
Cited by
268
References
31
Citations by year
2026: 13 · 2025: 10 · 2024: 13 · 2023: 9 · 2022: 4 · 2021: 14 · 2020: 8 · 2019: 9 · 2018: 7 · 2017: 8 · 2016: 6 · 2015: 5 · 2014: 8 · 2013: 14 · 2012: 12
FWCI
27.47
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum optics and atomic interactions
Keywords
distributed quantum computing, linear optics, single-photon sources, atom-cavity system, two-qubit gates, photon detectors

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