An Introduction to Boson-Sampling
Open accessThe DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Abstract
Boson-sampling is a simplified model for quantum computing that may hold the key to implementing the first ever post-classical quantum computer. Boson-sampling is a non-universal quantum computer that is significantly more straightforward to build than any universal quantum computer proposed so far. We begin this chapter by motivating boson-sampling and discussing the history of linear optics quantum computing. We then summarize the boson-sampling formalism, discuss what a sampling problem is, explain why boson-sampling is easier than linear optics quantum computing, and discuss the Extended Church-Turing thesis. Next, sampling with other classes of quantum optical states is analyzed. Finally, we discuss the feasibility of building a boson-sampling device using existing technology.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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?
In the citing paper
“In brief, the principle behind quantum error correction is to use more physical qubits to establish a set of fewer, but higher-fidelity, equivalent qubits called logical qubits 238 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [238]
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
The publisher hasn’t deposited this paper’s reference list.
Research works printed but not linked: 23
- [4]D. Aharonov. Annual Reviews of Computational Physics VI (ed. Stauffer, D.) . World Scientific, Singapore, 1999.
- [8]E. Bernstein and U Vazirani. Quantum complexity theory. Usiam Journal on Computing , 26:1411, 1997.
- [13]Paul E Ceruzzi. Cambridge, Mass: MIT Press, 2003.
- [20]M. D. Eisaman, J. Fan, A. Migdall, and S. V. Polyakov. Invited review article: Single-photon sources and detectors. Review of Scientific Instruments , 82(7):071101, 2011.
- [26]Christopher C. Gerry and Peter L. Knight. Introductory quantum optics . Cambridge University Press, 2005.
- [28]Lov K. Grover. Proc. 28th Annual ACM Symposium on the Theory of Computing (STOC) , page 212, 1996.
- [29]M. Jerrum, A. Sinclair, and E. Vigoda. A polynomialtime approximation algorithm for the permanent of a matrix with nonnegative entries. Journal of the ACM , 51: 673, 2004.
- [37]A. P. Lund, A. Laing, S. Rahimi-Keshari, T. Rudolph, J. L O'Brien, and T. C. Ralph. Boson sampling from gaussian states. 2013. arXiv:1305.4346. · arXiv
- [38]Xiao-Song Ma, Stefan Zotter, Johannes Kofler, Thomas Jennewein, and Anton Zeilinger. Experimental generation of single photons via active multiplexing. Phys. Rev. A , 83(4):043814, 2011.
- [41]AL Migdall, D Branning, and S Castelletto. Tailoring single-photon and multiphoton probabilities of a singlephoton on-demand source. Physical Review A , 66(5): 053805, 2002.
- [42]Keith R Motes, Jonathan P Dowling, and Peter P Rohde. Spontaneous parametric down-conversion photon sources are scalable in the asymptotic limit for boson sampling. Physical Review A , 88(6):063822, 2013.
- [46]M. Nielsen and I. Chuang. Quantum Computation and Quantum Information . Cambridge University Press, 2000.
- [50]Alberto Politi, Martin J. Cryan, John G. Rarity, Siyuan Yu, and Jeremy L. O'Brien. Silica-on-silicon waveguide quantum circuits. Science , 320(5876):646, 2008.
- [51]Alberto Politi, Jonathan C. F. Matthews, and Jeremy L. O'Brien. Shors quantum factoring algorithm on a photonic chip. Science , 325(5945):1221, 2009.
- [57]Peter P. Rohde. Optical quantum computing with photons of arbitrarily low fidelity and purity. Phys. Rev. A , 86(5), 2012.
- [59]Peter P. Rohde, James G. Webb, Elanor H. Huntington, and Timothy C. Ralph. Comparison of architectures for approximating number-resolving photo-detection using non-number-resolving detectors. 2007. arXiv:0705.4003. · arXiv
- Munro, and Jonathan P. Dowling. Sampling generalized cat states with linear optics is probably hard. 2013. arXiv:1310.0297. · arXiv
- [61]Peter P. Rohde, Keith R. Motes, Paul A. Knott, and William J. Munro. Will boson-sampling ever disprove the extended church-turing thesis? 2014. arXiv:1401.2199. · arXiv
- [64]K. Seshadreesan, J. Olson, K. Motes, P. Rohde, and J. Dowling. Boson sampling with photon-added coherent states. 2013. arXiv:1402.0531. · arXiv
- [65]V. S. Shchesnovich. A sufficient fidelity bound for scalability of the boson sampler computer. 2013. arXiv:1311.6796. · arXiv
- [67]C. Shen, Z. Zhang, and L.-M. Duan. Scalable implementation of boson sampling with trapped ions. 2013. arXiv:1310.4860. · arXiv
- [72]Max Tillmann, Si-Hui Tan, Sarah E Stoeckl, Barry C Sanders, Hubert de Guise, Ren´ e Heilmann, Stefan Nolte, Alexander Szameit, and Philip Walther. Bosonsampling with controllable distinguishability, 2014. arXiv:1403.3433. · arXiv
- [74]D. F. Walls and G. J. Milburn. Quantum Optics . Springer, Berlin, 1994.
Cited by
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Self-citationPhotonic quantum information processing: a review
Flamini, F., Spagnolo, N., & Sciarrino, F. (2019) · Reports on Progress in Physics · doi:10.1088/1361-6633/aad5b2 · Cited by 770
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · doi:10.1093/oso/9780198782995.001.0001 · Cited by 326
Schröder, T., Trusheim, M. E., Walsh, M., Li, L., Zheng, J., Schukraft, M., Sipahigil, A., Evans, R. E., Sukachev, D. D., Nguyen, C. T., et al. (2017) · Nature Communications · doi:10.1038/ncomms15376 · Cited by 228
Large-scale quantum photonic circuits in silicon
Harris, N. C., Bunandar, D., Pant, M., Steinbrecher, G. R., Mower, J., Prabhu, M., Baehr-Jones, T., Hochberg, M., & Englund, D. (2016) · Nanophotonics · doi:10.1515/nanoph-2015-0146 · Cited by 173
Metadata
- Authors
- Gard, B. T., Motes, K. R., Olson, J. P., Rohde, P. P., & Dowling, J. P.
- Affiliations
- Louisiana State University (US)
- Macquarie University (AU)
- University of Technology Sydney (AU)
- ORCID
- Rohde, Peter P.
- Venue
- From Atomic to Mesoscale
- Publisher
- WORLD SCIENTIFIC
- Published
- 2015-06-28
- Pages
- 167-192
- OpenAlex
- W1621949713
- Cited by
- 26
- References
- 0
- Citations by year
- 2026: 2 · 2025: 5 · 2024: 1 · 2023: 2 · 2022: 3 · 2021: 3 · 2020: 1 · 2019: 4 · 2018: 2 · 2017: 2 · 2016: 1
- FWCI
- 3.32
- Type
- book chapter
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- WORLD SCIENTIFIC eBooks (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- boson sampling, linear optics quantum computing, sampling problems
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Introduction to Boson-Sampling. https://app.cochat.ai/papers/10.1142/9789814678704_0008
- The paper
- Gard, B. T., Motes, K. R., Olson, J. P., Rohde, P. P., & Dowling, J. P. (2015). An Introduction to Boson-Sampling. From Atomic to Mesoscale. https://doi.org/10.1142/9789814678704_0008
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.