CoChat
Sign Up
Cited by 128Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum many-body systems

Applications of near-term photonic quantum computers: software and algorithms

Open access
Bromley, Thomas R, Arrazola, Juan Miguel, Jahangiri, Soran, Izaac, Josh, Quesada, Nicolás, Gran, Alain Delgado, Schuld, Maria, Swinarton, Jeremy +2 more·2020·Quantum Science and Technology
DOI 10.1088/2058-9565/ab8504
Open this paper in CoChat — free accountOpen PDF

Abstract

Gaussian boson sampling (GBS) is a near-term platform for photonic quantum computing. Recent efforts have led to the discovery of GBS algorithms with applications to graph-based problems, point processes, and molecular vibronic spectra in chemistry. The development of dedicated quantum software is a key enabler in permitting users to program devices and implement algorithms. In this work, we introduce a new applications layer for the Strawberry Fields photonic quantum computing library. The applications layer provides users with the necessary tools to design and implement algorithms using GBS with only a few lines of code. This paper serves a dual role as an introduction to the software, supported with example code, and also a review of the current state of the art in GBS algorithms.

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.1088/2058-9565/ab8504

Cites

117 of 118 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?

  • For a pure Gaussian state, the A matrix is symmetric.

    “For a pure Gaussian state, it can be shown that the A matrix is symmetric (Bromley et al. , 2020).”

    From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Bromley et al., 2020

  • CO applications of photonic QC include dense subgraph identification, Max-Clique, and graph similarity.

    “CO applications of photonic QC include dense subgraph identification, Max-Clique, and graph similarity [24].”

    From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [24]

  • Within the gate-model domain, a further distinction can be made between VQAs, Grover-based approaches, and other gate-based approaches.

    “Within the gate-model domain, a further distinction can be made between VQAs, Grover-based approaches [52, 118], and other gate-based approaches that have been mentioned above, e.g., References [15, 16, 24, 94].”

    From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [24]

    The citation is attached to “Grover-based approaches,” but no passage found in our copy discusses Grover or classifies Grover-based methods within the gate model. Section 2.1 distinguishes variational algorithms from other gate sequences; Section 4 instead reviews Gaussian boson sampling algorithms. Searches for “Grover,” “Grover search algorithm,” and the proposed gate-model distinction did not establish the attributed point. (LLM, conf=0.75)

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

  1. Nielsen M and Chuang I 2010 Quantum Computation and Quantum Information (Cambridge: Cambridge University Press)
  2. Shor P W 1994 Proc. 35th Annual Symp. on Foundations of Computer Science (Piscataway, NJ: IEEE) pp 124-34
  3. Gidney C and Ekerå M 2019 arXiv:1905.09749 · arXiv
  4. Berry D W, Childs A M and Kothari R 2015 2015 IEEE 56th Annual Symp. on Foundations of Computer Science (FOCS) (Piscataway, NJ: IEEE) pp 792-809
  5. Aaronson S and Arkhipov A 2013 Theor. Comput. 9 143 · DOI
  6. Bergholm V, Izaac J, Schuld M, Gogolin C and Killoran N 2018 arXiv:1811.04968 · arXiv
  7. McClean J R et al 2017 arXiv:1710.07629 · arXiv
  8. Smith R S, Curtis M J and Zeng W J 2016 A Practical Quantum Instruction Set Architecture arXiv:1608.03355 · arXiv
  9. Smelyanskiy M, Sawaya N P and Aspuru-Guzik A 2016 arXiv:1601.07195 · arXiv
  10. Zhang F et al 2019 arXiv:1907.11217 · arXiv
  11. Banchi L, Fingerhuth M, Babej T, Ing C and Arrazola J M 2019 arXiv:1902.00462 · arXiv
  12. Bradler K, Friedland S, Izaac J, Killoran N and Su D 2018 arXiv:1810.10644 · arXiv
  13. Bradler K, Israel R, Schuld M and Su D 2019 arXiv:1910.04022 · arXiv
  14. Vaidya V et al 2019 arXiv:1904.07833 · arXiv
  15. Gupt B, Arrazola J M, Quesada N and Bromley T R 2018 arXiv:1810.00900 · arXiv
  16. Wu B, Cheng B, Zhang J, Yung M-H and Sun X 2019 arXiv:1908.10070 · arXiv
  17. Horn R A and Johnson C R 1990 Matrix Analysis (Cambridge: Cambridge University Press)
  18. Saha B, Hoch A, Khuller S, Raschid L and Zhang X-N 2010 Annual Int. Conf. on Research in Computational Molecular Biology (Berlin: Springer) pp 456-72
  19. Charikar M 2000 International Workshop on Approximation Algorithms for Combinatorial Optimization (Berlin: Springer) pp 84-95
  20. Bomze I M, Budinich M, Pardalos P M and Pelillo M 1999 Handbook of Combinatorial Optimization (Boston, MA: Springer) pp 1-74
  21. Karp R M 1972 Complexity of Computer Computations (Berlin: Springer) pp 85-103
  22. Malod-Dognin N, Andonov R and Yanev N 2010 International Symposium on Experimental Algorithms (Berlin: Springer) pp 106-17
  23. Pattillo J, Youssef N and Butenko S 2012 Handbook of Optimization in Complex Networks (Berlin: Springer) pp 143-62
  24. Balasundaram B and Butenko S 2006 Handbook of Optimization in Telecommunications (Berlin: Springer) pp 865-90
  25. Pelillo M 2009 Encyclopedia of Optimization (New York, NY: Springer) pp 1508 -20
  26. Gärtner T, Flach P and Wrobel S 2003 Learning Theory and Kernel Machines (Berlin: Springer) pp 129-43
  27. Grover A and Leskovec J 2016 Proc. of the 22nd ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (New York: ACM) pp 855-64
  28. Kriege N and Mutzel P 2012 Proc. of the 29th Int. Conf. on Machine Learning
  29. Daley D J and Vere-Jones D 2003 An Introduction to the Theory of Point Processes: Volume I: Probability and its Applications (Berlin: Springer Science & Business Media)
  30. Daley D J and Vere-Jones D 2007 An Introduction to the Theory of Point Processes: Volume II: General Theory and Structure (Berlin: Springer Science & Business Media)
  31. Borodin A 2009 arXiv:0911.1153 · arXiv
  32. Bauwens L and Hautsch N 2009 Handbook of Financial Time Series (Berlin: Springer) pp 953-79
  33. Bacry E, Mastromatteo I and Muzy J-F 2015 arXiv:1502.04592 · arXiv
  34. Kulesza A and Taskar B 2010 Structured determinantal point processes Advances in Neural Information Processing Systems (Red Hook, NY: Curran Associates) pp 1171-9 · DOI
  35. Kulesza A and Taskar B 2011 Proc. of the 28th Int. Conf. on Machine Learning (ICML-11) pp 1193-200
  36. Lin H and Bilmes J A 2012 arXiv:1210.4871 · arXiv
  37. Gillenwater J A, Kulesza A, Fox E and Taskar B 2014 Expectation-maximization for learning determinantal point processes Advances in Neural Information Processing Systems (Cambridge, MA: MIT Press) pp 3149-57 · DOI
  38. Herzberg G 1988 The Spectra and Structures of Simple Free Radicals: An Introduction to Molecular Spectroscopy (Ithaca, NY: Cornell University Press)
  39. Ruhoff P T and Ratner M A 2000 Int. J. Quantum Chem. 77 383 · DOI

Cited by

Sorted by citations

Related

Authors
Bromley, T. R., Arrazola, J. M., Jahangiri, S., Izaac, J., Quesada, N., Gran, A. D., Schuld, M., Swinarton, J., Zabaneh, Z., & Killoran, N.
Affiliations
Xanadu Quantum Technologies (Canada) (CA)
ORCID
Venue
Quantum Science and Technology
Publisher
IOP Publishing
Published
2020-05-12
Volume
5
Issue
3
Pages
034010
ISSN
2058-9565 (ISSN-L)
DOI
10.1088/2058-9565/ab8504
OpenAlex
W2995724754
Cited by
128
References
117
Citations by year
2026: 12 · 2025: 19 · 2024: 20 · 2023: 23 · 2022: 22 · 2021: 23 · 2020: 8 · 2019: 1
FWCI
7.46
Type
journal article
Language
en
Open access
Licence
Locations
  • Quantum Science and Technology (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • PolyPublie (École Polytechnique de Montréal) (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 › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
Gaussian boson sampling, photonic quantum computing, strawberry fields, quantum computing software, quantum algorithms, graph problems, point processes, near-term 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