Cited by 837Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Boson Sampling on a Photonic Chip

Open access
Spring, Justin B., Metcalf, Benjamin J., Humphreys, Peter C., Kolthammer, W. Steven, Jin, Xian-Min, Barbieri, Marco, Datta, Animesh, Thomas-Peter, Nicholas +6 more·2013·Science

Abstract

Computing Power of Quantum Mechanics: There is much interest in developing quantum computers in order to perform certain tasks much faster than, or that are intractable for, a classical computer. A general quantum computer, however, requires the fabrication and operation a number of quantum logic devices (see the Perspective by Franson ). Broome et al. (p. 794 , published online 20 December) and Spring et al. (p. 798 , published online 20 December) describe experiments in which single photons and quantum interference were used to perform a calculation (the permanent of a matrix) that is very difficult on a classical computer. Similar to random walks, quantum walks on a graph describe the movement of a walker on a set of predetermined paths; instead of flipping a coin to decide which way to go at each point, a quantum walker can take several paths at once. Childs et al. (p. 791 ) propose an architecture for a quantum computer, based on quantum walks of multiple interacting walkers. The system is capable of performing any quantum operation using a subset of its nodes, with the size of the subset scaling favorably with the complexity of the operation.

Integrity signals

Registry

Crossref · 10.1126/science.1231692

Cites

7 of 7 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • Multiphoton quantum walks have the potential to demonstrate an undisputed quantum advantage through the boson-sampling algorithm.

    “Further attention has been devoted to the computational complexity of multiphoton quantum walks, which has the potential to demonstrate an undisputed quantum advantage through the boson-sampling algorithm (13–19).”

    From Two-photon quantum walk in a multimode fiber (2016) · cites this paper as [15]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Spring, J. B., Metcalf, B. J., Humphreys, P. C., Kolthammer, W. S., Jin, X.-M., Barbieri, M., Datta, A., Thomas-Peter, N., Langford, N. K., Kundys, D., Gates, J. C., Smith, B. J., Smith, P. G. R., & Walmsley, I. A.
Affiliations
  • University of Oxford (GB)
  • Shanghai Jiao Tong University (CN)
  • Royal Holloway University of London (GB)
  • University of Southampton (GB)
Corresponding author
  • Spring, Justin B.
  • Walmsley, Ian A.
Venue
Science
Published
2013-02-15
Volume
339
Issue
6121
Pages
798-801
ISSN
  • 0036-8075 (ISSN-L)
  • 1095-9203
OpenAlex
W2052612308
Cited by
837
References
7
Citations by year
2026: 16 · 2025: 34 · 2024: 39 · 2023: 60 · 2022: 61 · 2021: 61 · 2020: 79 · 2019: 81 · 2018: 89 · 2017: 81 · 2016: 80 · 2015: 73 · 2014: 54 · 2013: 26 · 2012: 1
FWCI
48.50
Type
journal article
Language
en
Open access
Locations
  • Science (publishedVersion)
  • PubMed (publishedVersion)
  • ePrints Soton (University of Southampton) (acceptedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Iris (Roma Tre University) (submittedVersion)
  • arXiv (Cornell University)
Funders
Engineering and Physical Sciences Research Council (EP/C013956/1, EP/H03031X/1, EP/J000051/1, EP/E036066/1, EP/C013840/1)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
boson sampling, photonic integrated circuits, quantum computing, permanent, quantum interference, single photons, quantum walks, quantum computing architecture, computational complexity

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