CoChat
Sign Up
Cited by 690Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Almost Any Quantum Logic Gate is Universal

Lloyd, Seth·1995·Physical Review Letters
DOI 10.1103/physrevlett.75.346
Open this paper in CoChat — free account

Abstract

It is shown that if one can apply some Hamiltonian repeatedly to a few variables at a time one can in general effect any desired unitary time evolution on an arbitrarily large number of variables. As a result, almost any quantum logic gate with two or more inputs is computationally universal in that copies of the gate can be ``wired together'' to effect any desired logic circuit, and to perform any desired unitary transformation on a set of quantum variables.

Integrity signals

Registry

Crossref · 10.1103/physrevlett.75.346

Cites

7 of 7 references verified0 citation errors · 0 not checkable

Statistics

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

Claims the paper makes

This paper’s full text isn’t openly available, 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?

  • Essentially any quantum system that admits controllable nonlinear interactions can be shown to be computationally universal.

    “Essentially any quantum system that admits controllable nonlinear interactions can be shown to be computationally universal 60 -61 .”

    From Ultimate physical limits to computation (2000) · cites this paper as [60]

  • A wide variety of physical systems-ranging from nearest neighbor Ising models to quantum electrodynamics and conformal field theories-are known to be computationally universal.

    “Although computational universality might at first seem to be a stringent demand on a physical system, a wide variety of physical systems - ranging from nearest neighbor Ising models 52 to quantum electrodynamics 84 and conformal field theories 86 - are known to be computationally universal 51 -53 , 55 -65 .”

    From Ultimate physical limits to computation (2000) · cites this paper as [60]

  • For the input state (|1_BnZr>_a + |1+>_a) tensor (|1_BnZr>_b + |1+>_b)/2, the sum of expectation values in the appropriate CHSH inequality is 2 sqrt(1 + sin^2(phi/2)); the measured conditional phase shift phi approximately 16 degrees per photon would generate a value of 2.02.

    “we consider the input state (j1 BnZr i a +j1 + i a ) (j1 BnZr i b +j1 + i b )=2, for which the sum of expectation values in the appropriate CHSH inequality is 2 q 1 + sin 2 (=2). Note that 2 corresponds to the classical upper limit, while the measured conditional phase shift 16 per photon would generate a value of 2:02”

    From Measurement of Conditional Phase Shifts for Quantum Logic (1995) · cites this paper as [13]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Lloyd, S.
Affiliations
Massachusetts Institute of Technology (US)
Corresponding author
Lloyd, Seth
ORCID
Lloyd, Seth
Venue
Physical Review Letters
Publisher
American Physical Society (APS)
Published
1995-07-10
Volume
75
Issue
2
Pages
346-349
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
DOI
10.1103/physrevlett.75.346
OpenAlex
W1999450843
Cited by
690
References
7
Citations by year
2026: 8 · 2025: 24 · 2024: 28 · 2023: 20 · 2022: 27 · 2021: 23 · 2020: 13 · 2019: 25 · 2018: 11 · 2017: 17 · 2016: 16 · 2015: 14 · 2014: 15 · 2013: 10 · 2012: 21
FWCI
27.19
Type
journal article
Language
en
Open access
closed
Licence
link.aps.org/licenses/aps-default-license (vor)
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
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
quantum gates, universality, Hamiltonian evolution, unitary transformation, quantum circuits, 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