Sufficient condition for the mode mismatch of single photons for scalability of the boson-sampling computer
Open accessThe DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Abstract
The boson sampler proposed by Aaronson and Arkhipov is a nonuniversal quantum computer, which can serve as evidence against the extended Church-Turing thesis. It samples the probability distribution at the output of a linear unitary optical network with indistinguishable single photons at the input. Four experimental groups have already tested their small-scale prototypes with up to four photons. A boson sampler with a few dozens of single photons is believed to be hard to simulate on a classical computer. For scalability of a realistic boson sampler with current technology it is necessary to know the effect of the photon mode mismatch on its operation. Here a nondeterministic model of the boson sampler is analyzed, which employs partially indistinguishable single photons emitted by identical sources. A sufficient condition on the average mutual fidelity $\ensuremath{\langle}\mathcal{F}\ensuremath{\rangle}$ of the single photons is found, which guarantees that the realistic boson sampler outperforms the classical computer. Moreover, the boson-sampler computer with partially indistinguishable single photons is scalable and has more power than classical computers when the single-photon mode mismatch $1\ensuremath{-}\ensuremath{\langle}\mathcal{F}\ensuremath{\rangle}$ scales as $O({N}^{\ensuremath{-}3/2})$ with the total number of photons $N$.
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.
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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Measurement of subpicosecond time intervals between two photons by interference
Hong, C. K., Ou, Z. Y., & Mandel, L. (1987) · Physical Review Letters · doi:10.1103/physrevlett.59.2044 · Cited by 4,369
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
Ryser, H. (1963) · Carus Mathematical Monographs · doi:10.5948/upo9781614440147 · Cited by 969
Lounis, B., & Orrit, M. (2005) · Reports on Progress in Physics · doi:10.1088/0034-4885/68/5/r04 · Cited by 908
Deterministic Single-Photon Source for Distributed Quantum Networking
Kuhn, A., Hennrich, M., & Rempe, G. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.067901 · Cited by 859
Boson Sampling on a Photonic Chip
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., et al. (2013) · Science · doi:10.1126/science.1231692 · Cited by 837
Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
Abrams, D. S., & Lloyd, S. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.2586 · Cited by 745
Tillmann, M., Dakić, B., Heilmann, R., Nolte, S., Szameit, A., & Walther, P. (2013) · Nature Photonics · doi:10.1038/nphoton.2013.102 · Cited by 709
Cited by
Photonic 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
Scalable integrated single-photon source
Uppu, R., Pedersen, F. T., Wang, Y., Olesen, C. T., Papon, C., Zhou, X., Midolo, L., Scholz, S., Wieck, A. D., Ludwig, A., et al. (2020) · Science Advances · doi:10.1126/sciadv.abc8268 · Cited by 309
Photonic implementation of boson sampling: a review
Brod, D. J., Galvão, E. F., Crespi, A., Osellame, R., Spagnolo, N., & Sciarrino, F. (2019) · Advanced Photonics · doi:10.1117/1.ap.1.3.034001 · Cited by 159
Computational advantage of quantum random sampling
Hangleiter, D., & Eisert, J. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.035001 · Cited by 145
Stringent and Efficient Assessment of Boson-Sampling Devices
Tichy, M. C., Mayer, K., Buchleitner, A., & Mølmer, K. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.020502 · Cited by 127
Metadata
- Authors
- Shchesnovich, V. S.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2014-02-24
- Volume
- 89
- Issue
- 2
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2070606743
- Cited by
- 72
- References
- 17
- FWCI
- 8.58
- Type
- journal article
- Language
- en
- Open access
- green
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: Sufficient condition for the mode mismatch of single photons for scalability of the boson-sampling computer. https://app.cochat.ai/papers/10.1103/physreva.89.022333
- The paper
- Shchesnovich, V. S. (2014). Sufficient condition for the mode mismatch of single photons for scalability of the boson-sampling computer. Physical Review A. https://doi.org/10.1103/physreva.89.022333
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.