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

The DOI matches its Crossref record; 117 of the 118 references it cites were found in a registry or an index, and 1 are not checked yet.

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, Zabaneh, Zeid, Killoran, Nathan·2020·Quantum Science and Technology

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.

Overview

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

Verification

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?

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

Show all 117 references

Research works printed but not linked: 8

  1. Aaronson, 2013, Theor. Comput., 9, 143, 10.4086/toc.2013.v009a004 · DOI
  2. Wang, 2019, Nat. Photon., 1
  3. Kluyver, 2016, El Público, 87
  4. Johnson, 1993, Discrete Math. Theor. Comput. Sci., 26, 11
  5. Vishwanathan, 2010, J. Mach. Learn. Res., 11, 1201
  6. Shervashidze, 2011, J. Mach. Learn. Res., 12, 2539
  7. Pedregosa, 2011, J. Mach. Learn. Res., 12, 2825
  8. Ruhoff, 2000, Int. J. Quantum Chem., 77, 383, 10.1002/(sici)1097-461x(2000)77:1<383::aid-qua38>3.0.co;2-0 · DOI

Cited by

Sorted by citations

Items 101–128 of 128

Metadata

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)
Venue
Quantum Science and Technology
Published
2020-05-12
Volume
5
Issue
3
Pages
034010
ISSN
2058-9565 (ISSN-L)
OpenAlex
W2995724754
Cited by
128
References
117
Citations by year
2026: 12 · 2025: 19 · 2024: 20 · 2023: 23 · 2022: 22 · 2021: 23 · 2020: 8
FWCI
7.46
Type
journal article
Language
en
Open access
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 › 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 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