Quantum-Mechanical Computers
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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 [55]
Cited by
Sorted by citations
Quantum information with continuous variables
Braunstein, S. L., & van Loock, P. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.513 · Cited by 3,858 · see citing works
Bulk Spin-Resonance Quantum Computation
Gershenfeld, N. A., & Chuang, I. L. (1997) · Science · doi:10.1126/science.275.5298.350 · Cited by 1,528 · see citing works
Quantum computation and Shor's factoring algorithm
Ekert, A., & Jozsa, R. (1996) · Reviews of Modern Physics · doi:10.1103/revmodphys.68.733 · Cited by 1,354 · see citing works
NMR techniques for quantum control and computation
Vandersypen, L. M. K., & Chuang, I. L. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.76.1037 · Cited by 1,217 · see citing works
Ultimate physical limits to computation
Lloyd, S. (2000) · Nature · doi:10.1038/35023282 · Cited by 1,120 · see citing works
Self-citationExperimental realization of a quantum algorithm
Chuang, I. L., Vandersypen, L. M. K., Zhou, X., Leung, D. W., & Lloyd, S. (1998) · Nature · doi:10.1038/30181 · Cited by 604 · see citing works
Self-citationA Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits
Amy, M., Maslov, D., Mosca, M., & Roetteler, M. (2013) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2013.2244643 · Cited by 549 · see citing works
“Specifically, we generated a circuit for the controlled-T gate using the decomposition FREDKIN· (I ⊗ I ⊗ T ) · FREDKIN, and a circuit for the 1-bit adder by using the implementation found in [10], substituting the circuit in Fig.”
MethodSemiclassical Fourier Transform for Quantum Computation
Griffiths, R. B., & Niu, C.-S. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.3228 · Cited by 431 · see citing works
Calculating the thermal rate constant with exponential speedup on a quantum computer
Lidar, D. A., & Wang, H. (1999) · Physical Review E · doi:10.1103/physreve.59.2429 · Cited by 115 · see citing works
- Authors
- Lloyd, S.
- Corresponding author
- Lloyd, Seth
- ORCID
- Lloyd, Seth
- Venue
- Scientific American
- Published
- 1995-10
- Volume
- 273
- Issue
- 4
- Pages
- 140-145
- ISSN
- 0036-8733 (ISSN-L)
- OpenAlex
- W2092628095
- Cited by
- 150
- References
- 0
- Citations by year
- 2026: 1 · 2024: 2 · 2023: 2 · 2020: 1 · 2019: 2 · 2016: 1 · 2015: 2 · 2014: 2 · 2013: 3 · 2012: 3
- FWCI
- 19.08
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Scientific American (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 computing, quantum computing hardware, quantum mechanics, quantum information
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
