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

Optical simulation of quantum logic

Open access
Cerf, N. J., Adami, C., Kwiat, P. G.·1998·Physical Review A

Abstract

A constructive method for simulating small-scale quantum circuits by use of linear optical devices is presented. It relies on the representation of several quantum bits by a single photon, and on the implementation of universal quantum gates using simple optical components (beam splitters, phase shifters, etc.). This suggests that the optical realization of small quantum networks with present-day quantum optics technology is a reasonable goal. This technique could be useful for demonstrating basic concepts of simple quantum algorithms or error-correction schemes. The optical analog of a nontrivial three-bit quantum circuit is presented as an illustration.

Integrity signals

Registry

Crossref · 10.1103/physreva.57.r1477

Cites

17 of 17 references verified0 citation errors · 0 not checkable

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?

  • The physical mechanism of type-I fusion is two-photon interference at the PBS, used as a parity check.

    “The physical mechanism of type-I fusion is again two-photon interference at the PBS, which is used as a parity check”

    From Multiphoton entanglement and interferometry (2012) · cites this paper as Cerf et al., 1998

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Cerf, N. J., Adami, C., & Kwiat, P. G.
Affiliations
  • California Institute of Technology (US)
  • Los Alamos National Laboratory (US)
Venue
Physical Review A
Published
1998-03-01
Volume
57
Issue
3
Pages
R1477-R1480
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W1993324774
Cited by
324
References
17
Citations by year
2026: 3 · 2025: 12 · 2024: 18 · 2023: 13 · 2022: 12 · 2021: 7 · 2020: 5 · 2019: 11 · 2018: 8 · 2017: 15 · 2016: 14 · 2015: 9 · 2014: 7 · 2013: 5 · 2012: 7
FWCI
22.04
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) (submittedVersion)
  • CaltechAUTHORS (California Institute of Technology) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Science Foundation
  • Defense Advanced Research Projects Agency
  • Army Research Office
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
linear optical quantum computing, qubits, universal quantum gates, beam splitter, phase shifters, quantum networks, quantum algorithms, quantum error correction

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