Cited by 141Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Scalable Boson Sampling with Time-Bin Encoding Using a Loop-Based Architecture

Open access
Motes, Keith R., Gilchrist, Alexei, Dowling, Jonathan P., Rohde, Peter P.·2014·Physical Review Letters

Abstract

We present an architecture for arbitrarily scalable boson sampling using two nested fiber loops. The architecture has fixed experimental complexity, irrespective of the size of the desired interferometer, whose scale is limited only by fiber and switch loss rates. The architecture employs time-bin encoding, whereby the incident photons form a pulse train, which enters the loops. Dynamically controlled loop coupling ratios allow the construction of the arbitrary linear optics interferometers required for boson sampling. The architecture employs only a single point of interference and may thus be easier to stabilize than other approaches. The scheme has polynomial complexity and could be realized using demonstrated present-day technologies.

Integrity signals

Registry

Crossref · 10.1103/physrevlett.113.120501

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • By encoding quantum information in sequential pulses of light, large and highly entangled states can be processed with a relatively small number of optical components.

    “By encoding quantum information in sequential pulses of light—effectively multiplexing a small number of optical channels to process information on a large number of modes20—large and highly entangled states can be processed with a relatively small number of optical components.”

The citation lists haven’t been fetched yet

References 25 · Cited by 141

Authors
Motes, K. R., Gilchrist, A., Dowling, J. P., & Rohde, P. P.
Affiliations
  • Macquarie University (AU)
  • Louisiana State University (US)
Venue
Physical Review Letters
Published
2014-09-18
Volume
113
Issue
12
Pages
120501-120501
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2009630586
Cited by
141
References
25
Citations by year
2026: 9 · 2025: 10 · 2024: 14 · 2023: 4 · 2022: 10 · 2021: 8 · 2020: 13 · 2019: 18 · 2018: 12 · 2017: 13 · 2016: 14 · 2015: 14 · 2014: 2
FWCI
14.29
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • UTS ePRESS (University of Technology Sydney) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Air Force Office of Scientific Research (AFOSR)
  • Army Research Office (ARO)
  • National Science Foundation (NSF)
  • Australian Research Council Centre of Excellence for Engineered Quantum Systems (CE110001013)
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 Mechanics and Applications
Keywords
boson sampling, time-bin encoding, fiber loop, scalable quantum computing, polynomial complexity, photonics

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