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

Universality in quantum computation

Open access
Deutsch, David Elieser, Barenco, Adriano, Ekert, Artur·1995·Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
DOI 10.1098/rspa.1995.0065
Open this paper in CoChat — free accountOpen PDF

Abstract

We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as logic gates.

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.1098/rspa.1995.0065

Cites

3 of 3 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?

  • 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 [61]

  • 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 [61]

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

  1. [1][1] D. Deutsch, Proc. R. Soc. London A 400 , 97 (1985). -
  2. [3][3] P.W. Shor, Proc. 35th Ann. Symp. on the Foundations of Computer Science (IEEE Computer Society, Los Alamitos, 1994), p.124. -
  3. [4][4] D. Deutsch and R. Jozsa, Proc. R. Soc. Lond. A 439 , 553 (1992); E. Bernstein and U. Vazirani, Proc. 25th ACM Symp. on Theory of Computation , p.11 (1993). -
  4. [5][5] S. Wiesner, SIGACT News, 15 , 78 (1983); C. H. Bennett and G. Brassard, in Proc. IEEE Int. Conference on Computers, Systems and Signal Processing , (IEEE, New York, 1984).; A. K. Ekert, Phys. Rev. Lett. 67 , 661 (1991); C. H. Bennett, Phys. Rev. Lett. 68 , 3121 (1992). -
  5. [6][6] D. Deutsch, Proc. R. Soc. Lond. A 425 , 73 (1989). -
  6. [7][7] A. Barenco, University of Oxford preprint (1994). -
  7. [8][8] T. Sleator and H. Weinfurter, preprint (1994). -
  8. [10][10] A. Yao, Proc. 34th IEEE Symp. on Foundation of Computer Science (IEEE Computer Society Press, Los Alamitos, 1993), pp.352-360. -
  9. [11][11] A. Berthiaume, D. Deutsch and R. Jozsa, The stabilization of quantum computations , in Proceedings of the Workshop on the Physics and ComputationPhysComp '94 (IEEE Computer Society Press, Dallas, Texas). -
  10. [13][13] S.Lloyd, preprint (1994).

Cited by

Sorted by citations

Authors
Deutsch, D. E., Barenco, A., & Ekert, A.
Affiliations
University of Oxford (GB)
Venue
Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
Publisher
The Royal Society
Published
1995-06-08
Volume
449
Issue
1937
Pages
669-677
ISSN
  • 0962-8444 (ISSN-L)
  • 2053-9177
DOI
10.1098/rspa.1995.0065
OpenAlex
W2020123688
Cited by
346
References
3
Citations by year
2026: 6 · 2025: 11 · 2024: 19 · 2023: 10 · 2022: 10 · 2021: 5 · 2020: 6 · 2019: 12 · 2018: 7 · 2017: 3 · 2016: 5 · 2015: 5 · 2014: 3 · 2013: 4 · 2012: 12
FWCI
17.63
Type
journal article
Language
en
Open access
Licence
royalsociety.org/journals/ethics-policies/data-sharing-mining/ (tdm)
Locations
  • Proceedings of the Royal Society of London Series A Mathematical and Physical Sciences (publishedVersion)
  • arXiv (Cornell University) (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 Mechanics and Applications
Keywords
quantum computing, universal quantum gates, universality, multi-qubit gates, logic gates, quantum circuits

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