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

Photonic Boson Sampling in a Tunable Circuit

Open access
Broome, Matthew A., Fedrizzi, Alessandro, Rahimi-Keshari, Saleh, Dove, Justin, Aaronson, Scott, Ralph, Timothy C., White, Andrew G.·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 byFranson).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.

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.1126/science.1231440

Cites

4 of 4 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?

  • 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 [16]

    The paper describes boson sampling with multiple photons in a linear-optical circuit and presents scaling it up as a route to quantum computational advantage (pp. 1–2). It does not support the stronger word “undisputed”: it calls the large-scale advantage conjectural, notes that efficient verification is unknown, and says scaling would provide strong evidence. (LLM, conf=0.84)

    Experimental — accuracy not yet measured

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: 11

  1. [1]P. Shor, Proc. 35th Ann. Symp. Found. Comp. Sci. (IEEE Comp. Soc. Press) (1994).
  2. [2]S. J. Aaronson, Ph.D. thesis, University of California, Berkeley (2004).
  3. [4]S. Aaronson and A. Arkhipov, Proc. ACM Symposium on Theory of Computing, San Jose, CA pp. 333-342 (2011).
  4. [5]S. Aaronson, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Science 467 , 3393 (2011).
  5. [7]M. J. Bremner, R. Jozsa, and D. J. Shepherd, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Science 467 , 459 (2011).
  6. [10]A. Laing and J. L. O'Brien, arXiv:1208.2868 (2012). · arXiv
  7. [11]S. Scheel, arXiv:quant-ph/0406127v1 (2004). · arXiv
  8. [18]J. O. Owens, M. A. Broome, D. N. Biggerstaff, M. E. Goggin, A. Fedrizzi, T. Linjordet, M. Ams, G. D. Marshall, J. Twamley, M. J. Withford, et al., New Journal of Physics 13 , 075003 (2011).
  9. [21]B. Metcalf, N. Thomas-Peter, J. Spring, D. Kundys, M. Broome, P. Humphreys, X. Jin, M. Barbieri, W. Kolthammer, J. Gates, et al., arXiv:1208.4575 (2012). · arXiv
  10. [30]L. Mandel, Phys. Rev. A 28 , 929 (1983), URL http: //link.aps.org/doi/10.1103/PhysRevA.28.929 . · DOI
  11. [32]X. Ma, S. Zotter, J. Kofler, T. Jennewein, and A. Zeilinger, Physical Review A 83 , 043814 (2011).

Cited by

Sorted by citations

Authors
Broome, M. A., Fedrizzi, A., Rahimi-Keshari, S., Dove, J., Aaronson, S., Ralph, T. C., & White, A. G.
Affiliations
  • The University of Queensland (AU)
  • Massachusetts Institute of Technology (US)
Corresponding author
Broome, Matthew A.
Venue
Science
Published
2013-02-15
Volume
339
Issue
6121
Pages
794-798
ISSN
  • 0036-8075 (ISSN-L)
  • 1095-9203
OpenAlex
W2084371989
Cited by
634
References
4
Citations by year
2026: 12 · 2025: 20 · 2024: 34 · 2023: 37 · 2022: 32 · 2021: 45 · 2020: 49 · 2019: 59 · 2018: 69 · 2017: 61 · 2016: 68 · 2015: 66 · 2014: 51 · 2013: 28 · 2012: 1
FWCI
45.97
Type
journal article
Language
en
Open access
Locations
  • Science (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc-sa)
  • arXiv (Cornell University)
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 quantum computing, permanent, quantum walks, quantum interference, single photons, quantum computing

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