Cited by 709Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyRandom lasers and scattering media

Experimental boson sampling

Open access
Tillmann, Max, Dakić, Borivoje, Heilmann, René, Nolte, Stefan, Szameit, Alexander, Walther, Philip·2013·Nature Photonics

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.1038/nphoton.2013.102

Cites

11 of 11 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 [13]

    The opening passage (p. 1) says boson sampling with interfering photons has the potential to outperform conventional computers, supporting the claimed potential for quantum advantage. But the Introduction (p. 1) describes classical hardness as strongly believed, not established beyond dispute; the paper does not support the word “undisputed.” (LLM, conf=0.83)

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

  1. [5]Gao, W. et al. Teleportation-based realization of an optical quantum two-qubit entangling gate. Proceedings of the National Academy of Sciences 107 , 20869-20874 (2010).
  2. [15]Jordan, S. P. Permutational quantum computing. arXiv:0906.2508 (2010). · arXiv
  3. [16]Aaronson, S. & Arkhipov, A. The computational complexity of linear optics. arXiv:1011.3245v1 (2010). · arXiv
  4. [18]Aaronson, S. A linear-optical proof that the permanent is sharp-p-hard. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Science 467 , 33933405 (2011).
  5. [23]Arkhipov, A. & Kuperberg, G. The bosonic birthday paradox. ArXiv:1106.0849 (2011). · arXiv
  6. [24]Itoh, K., Watanabe, W., Nolte, S. & Schaffer, C. Ultrafast processes for bulk modification of transparent materials. MRS bulletin 31 , 620-625 (2006).
  7. [27]Metcalf, B. J. et al. Multi-photon quantum interference in a multi-port integrated photonic device. arXiv:quantph/1208.4575 (2012).
  8. [28]Laing, A. & O'Brien, J. L. Super-stable tomography of any linear optical device. arXiv:1208.2868 (2012). · arXiv
  9. [30]Thomas-Peter, N. et al. Integrated photonic sensing. arXiv:1104.1863 (2011). · arXiv

Cited by

Sorted by citations

Authors
Tillmann, M., Dakić, B., Heilmann, R., Nolte, S., Szameit, A., & Walther, P.
Affiliations
  • University of Vienna (AT)
  • Friedrich Schiller University Jena (DE)
Corresponding author
  • Tillmann, Max
  • Walther, Philip
Venue
Nature Photonics
Published
2013-05-12
Volume
7
Issue
7
Pages
540-544
ISSN
  • 1749-4885 (ISSN-L)
  • 1749-4893
OpenAlex
W2052783597
Cited by
709
References
11
Citations by year
2026: 24 · 2025: 31 · 2024: 40 · 2023: 51 · 2022: 42 · 2021: 56 · 2020: 58 · 2019: 65 · 2018: 75 · 2017: 69 · 2016: 69 · 2015: 64 · 2014: 52 · 2013: 12
FWCI
72.63
Type
journal article
Language
en
Open access
Locations
  • Nature Photonics (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • 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 › Acoustics and Ultrasonics › Random lasers and scattering media
Keywords
boson sampling, integrated photonics, three-photon interference, linear optical 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