Cited by 248Quantum Information and CryptographyQuantum Computing Algorithms and ArchitectureQuantum many-body systems

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

How Good Must Single Photon Sources and Detectors Be for Efficient Linear Optical Quantum Computation?

Open access
Varnava, Michael, Browne, Daniel E., Rudolph, Terry·2008·Physical Review Letters

Abstract

We present a scheme for linear optical quantum computation that is highly robust to imperfect single photon sources and inefficient detectors. In particular we show that if the product of the detector efficiency with the source efficiency is greater than 2/3, then efficient linear optical quantum computation is possible. This high threshold is achieved within the cluster state paradigm for quantum computation.

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

Cites

29 of 29 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

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?

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

Cited by

Sorted by citations

See all 248

Metadata

Authors
Varnava, M., Browne, D. E., & Rudolph, T.
Affiliations
Imperial College London (GB)
Venue
Physical Review Letters
Published
2008-02-12
Volume
100
Issue
6
Pages
060502-060502
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2052992792
Cited by
248
References
28
Citations by year
2026: 13 · 2025: 18 · 2024: 31 · 2023: 23 · 2022: 12 · 2021: 18 · 2020: 11 · 2019: 12 · 2018: 12 · 2017: 15 · 2016: 11 · 2015: 10 · 2014: 15 · 2013: 5 · 2012: 8
FWCI
17.45
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • UCL Discovery (University College London) (submittedVersion)
  • arXiv (Cornell University)
Funders
Engineering and Physical Sciences Research Council (GR/S51226/01)
Topics
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › 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 many-body systems
Keywords
linear optical quantum computation, single-photon sources, single-photon detectors, detector efficiency, source efficiency, cluster states

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