CoChat

Optical Quantum Computing

Open access
O'Brien, Jeremy L. · 2007 · Science

The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index; 10 of the 48 sources its claims cite were checked for support.

Abstract

In 2001, all-optical quantum computing became feasible with the discovery that scalable quantum computing is possible using only single-photon sources, linear optical elements, and single-photon detectors. Although it was in principle scalable, the massive resource overhead made the scheme practically daunting. However, several simplifications were followed by proof-of-principle demonstrations, and recent approaches based on cluster states or error encoding have dramatically reduced this worrying resource overhead, making an all-optical architecture a serious contender for the ultimate goal of a large-scale quantum computer. Key challenges will be the realization of high-efficiency sources of indistinguishable single photons, low-loss, scalable optical circuits, high-efficiency single-photon detectors, and low-loss interfacing of these components.

Overview

CoChat Summary

TL;DR

This review argues that all-optical quantum computing became feasible in 2001 with linear optics, single-photon sources, and detectors, and that later cluster-state and error-encoding schemes greatly reduced the resource overhead. It identifies high-efficiency indistinguishable single-photon sources, low-loss scalable optical circuits, high-efficiency detectors, and low-loss interfacing as key remaining challenges.

Key findings

  • Linear optical quantum computing was shown in 2001 to be scalable using only single-photon sources, linear optical elements, and single-photon detectors, despite requiring a strong optical nonlinearity for a conventional CNOT.
  • The original nondeterministic optical CNOT succeeded with probability \(P < 1\) (1/16 in the original scheme), failing the rest of the time (\(P = 15/16\)); teleportation-based approaches could make it deterministic on average by consuming 32 entangled states.
  • Early overhead was daunting: more than 10,000 pairs of entangled photons were needed for a near-deterministic CNOT with success probability >95%; newer cluster-state and error-encoding techniques reduced resources by 3–4 orders of magnitude.
  • Fault-tolerance estimates include a 1% threshold reported by Knill, an optical threshold requiring source–detector efficiency product >2/3 if all other components are perfect, and more complete treatments giving thresholds of \(10^{-3}\)–\(10^{-4}\).

Methods

  • Review/synthesis of theoretical and experimental work on optical quantum computing, covering linear optical quantum computing, cluster states, teleportation, error encoding, fault tolerance, sources, detectors, circuits, and nonlinear/hybrid approaches.
  • No primary data, sample, or new experiment is reported; the paper cites prior proofs-of-principle and proposals, including CNOT demonstrations and encoding against measurement error.
  • Main analysis is conceptual and comparative, assessing resource overheads, thresholds, and component requirements across optical architectures.

Limitations

  • The paper states that high-efficiency sources of indistinguishable single photons, low-loss scalable optical circuits, high-efficiency single-photon detectors, and low-loss interfacing of these components remain key challenges.
  • It notes that most experimental demonstrations to date relied on non-scalable single-photon sources, large-scale optical elements, and modest-efficiency detectors, and that it is not yet known whether the circuit or cluster model is most promising.
  • Evident from the text: this is a 2007 review, not an original research article, so its claims depend on cited prior work and may be overtaken by later developments.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1126/science.1142892

Cites

54 of 54 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

5 Valid · 0 Not valid · 27 Not checked · 14 Own results and interpretations

18 more claims

Create a free account to see all 46 claims and to verify the 38 references still open.

See all claims — free account
  • It may state two separate claims as one. 16
  • Probably not a substantial claim. 13

Create a free account to see these claims.

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?

Citations

Cites

Show all 54 references

Research works printed but not linked: 5

  1. T. C. Ralph, N. K. Langford, T. B. Bell, A. G. White, Phys. Rev. A65, 062324 (2001).
  2. H. F. Hofmann, S. Takeuchi, Phys. Rev. A66, 024308 (2001).
  3. M. Varnava D. Browne T. Rudolph arXiv:quant-ph/0702044 (2007). · arXiv
  4. J. Beugnonet al., Nature440, 779 (2007).
  5. K. Kieling T. Rudolph J. Eisert arXiv:quant-ph/0611140 (2006). · arXiv

Cited by

Items 701–800 of 1,000

Metadata

Authors
O'Brien, J. L.
Affiliations
Centre for Quantum Photonics, H. H. Wills Physics Laboratory and Department of Electrical and Electronic Engineering, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB, UK.
Venue
Science
Published
2007-12-07
Volume
318
Issue
5856
Pages
1567-1570
ISSN
  • 0036-8075 (ISSN-L)
  • 1095-9203
OpenAlex
W2047131277
Cited by
1,221
References
52
Citations by year
2026: 86 · 2025: 132 · 2024: 132 · 2023: 90 · 2022: 85 · 2021: 107 · 2020: 65 · 2019: 76 · 2018: 54 · 2017: 38 · 2016: 56 · 2015: 49 · 2014: 39 · 2013: 41 · 2012: 42
FWCI
31.39
Type
journal article
Language
en
Open access
Locations
  • Science (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Bristol Research (University of Bristol) (submittedVersion)
  • arXiv (Cornell University)
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 › Semiconductor Quantum Structures and Devices
Keywords
optical quantum computing, single-photon sources, single-photon detectors, linear optical elements, cluster states, resource overhead, scalable quantum computing, photon indistinguishability, optical circuits

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.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-07, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-07 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol and qwen3.8-omni-flash).

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.