Necessary and Sufficient Conditions for Quantum Computation
Abstract
Necessary and sufficient conditions are given for a quantummechanical system to possess a coordinate system with respect to which its behaviour at discrete times is that of a universal digital computer. The form of the diagonal representation for the unitary time evolution operator for quantum universal computers is derived; aspects of the transformation between the diagonal representation and the computational representation are shown to be uncomputable. A quantum-mechanical treatment of macroscopic, dissipative computers is given.
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 [53]
Cites
Messiah, A. (1961) · Cited by 16,012 · see citing works
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283 · see citing works
Mathematical Foundations of Quantum Mechanics
von Neumann, J. (2018) · Princeton University Press eBooks · doi:10.1515/9781400889921 · Cited by 5,043 · see citing works
Irreversibility and heat generation in the computing process
Landauer, R. (1961) · IBM Journal of Research and Development · doi:10.1147/rd.53.0183 · Cited by 4,980 · see citing works
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597 · see citing works
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679 · see citing works
Schwartz, L. (1966) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 3,541 · see citing works
Rapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700 · see citing works
The Theory of Groups and Quantum Mechanics
Weyl, H. (1931) · International Linear Collider · Cited by 2,698 · see citing works
Decoherence and the Transition from Quantum to Classical
Zurek, W. H. (1991) · Physics Today · doi:10.1063/1.881293 · Cited by 2,634 · see citing works
Computation: Finite and Infinite Machines.
Clarke, D. A., & Minsky, M. (1968) · American Mathematical Monthly · doi:10.2307/2313471 · Cited by 2,600 · see citing works
Fredkin, E., & Toffoli, T. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857727 · Cited by 1,896 · see citing works
Complexity, Entropy And The Physics Of Information
Zurek, W. H. (2018) · CRC Press eBooks · doi:10.1201/9780429502880 · Cited by 1,451 · see citing works
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284 · see citing works
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244 · see citing works
Consistent histories and the interpretation of quantum mechanics
Griffiths, R. B. (1984) · Journal of Statistical Physics · doi:10.1007/bf01015734 · Cited by 1,138 · see citing works
Feynman, R. P. (1985) · Optics News · doi:10.1364/on.11.2.000011 · Cited by 1,023 · see citing works
Reversible logic and quantum computers
Peres, A. (1985) · Physical Review A · doi:10.1103/physreva.32.3266 · Cited by 897 · see citing works
Logical reformulation of quantum mechanics. I. Foundations
Omn�s, R. (1988) · Journal of Statistical Physics · doi:10.1007/bf01014230 · Cited by 470 · see citing works
Milburn, G. J. (1989) · Physical Review Letters · doi:10.1103/physrevlett.62.2124 · Cited by 440 · see citing works
Unpredictability and undecidability in dynamical systems
Moore, C. (1990) · Physical Review Letters · doi:10.1103/physrevlett.64.2354 · Cited by 419 · see citing works
Quantum Kinematics and Dynamics
Schwinger, J. (2018) · CRC Press eBooks · doi:10.1201/9780429497933 · Cited by 292 · see citing works
Quantum Mechanics in Hilbert Space
Prugovečki, E. (1971) · Pure and applied mathematics · doi:10.1016/s0079-8169(08)x6034-9 · Cited by 244 · see citing works
Undecidability and intractability in theoretical physics
Wolfram, S. (1985) · Physical Review Letters · doi:10.1103/physrevlett.54.735 · Cited by 240 · see citing works
<i>Mathematical Foundations of Quantum Mechanics (Investigations in Physics No. 2)</i>
von Neumann, J., & Rose, M. E. (1955) · Physics Today · doi:10.1063/1.3061789 · Cited by 233 · see citing works
Maurin, K., Alexiewicz, A., & Zawadowski, W. (1972) · Cited by 210 · see citing works
Reversibility and Stability of Information Processing Systems
Zurek, W. H. (1984) · Physical Review Letters · doi:10.1103/physrevlett.53.391 · Cited by 111 · see citing works
Modelling cellular automata with partial differential equations
Omohundro, S. M. (1984) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(84)90255-0 · Cited by 90 · see citing works
Squeezed and Antibunched Light
Teich, M. C., & Saleh, B. E. A. (1990) · Physics Today · doi:10.1063/1.881246 · Cited by 77 · see citing works
Quantum Computation <sup>a</sup>
MARGOLUS, N. (1986) · Annals of the New York Academy of Sciences · doi:10.1111/j.1749-6632.1986.tb12451.x · Cited by 38 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
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
Ultimate physical limits to computation
Lloyd, S. (2000) · Nature · doi:10.1038/35023282 · Cited by 1,120 · see citing works
Self-citationBulk quantum computation with nuclear magnetic resonance: theory and experiment
Chuang, I. L., Gershenfeld, N., Kubinec, M. G., & Leung, D. W. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0170 · Cited by 316 · see citing works
Qubit devices and the issue of quantum decoherence
Brandt, H. E. (1999) · Progress in Quantum Electronics · doi:10.1016/s0079-6727(99)00003-8 · Cited by 98 · see citing works
An elementary review on basic principles and developments of qubits for quantum computing
Chae, E., Choi, J., & Kim, J. (2024) · Nano Convergence · doi:10.1186/s40580-024-00418-5 · Cited by 89 · see citing works
Undecidability of the Spectral Gap in One Dimension
Bausch, J., Cubitt, T. S., Lucia, A., & Pérez-Garcı́a, D. (2020) · Physical Review X · doi:10.1103/physrevx.10.031038 · Cited by 37 · see citing works
Undecidability of the Spectral Gap
Cubitt, T. S., Pérez-Garcı́a, D., & Wolf, M. M. (2022) · Forum of Mathematics Pi · doi:10.1017/fmp.2021.15 · Cited by 14 · see citing works
Epistemic Horizons and the Foundations of Quantum Mechanics
Szangolies, J. (2018) · Foundations of Physics · doi:10.1007/s10701-018-0221-9 · Cited by 12 · see citing works
Tight Binding Hamiltonians and Quantum Turing Machines
Benioff, P. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.590 · Cited by 13 · see citing works
Error correction for a spin quantum computer
Berman, G. P., Campbell, D. K., & Tsifrinovich, V. I. (1997) · Physical review. B, Condensed matter · doi:10.1103/physrevb.55.5929 · Cited by 11 · see citing works
Realization of multimode operators with passive linear optics and photodetection
Clausen, J., Knöll, L., & Welsch, D. ‐. (2003) · Physical Review A · doi:10.1103/physreva.68.043822 · Cited by 10 · see citing works
Undecidability in physics: A review
Perales, Á., Cubitt, T. S., Gu, M., Pérez-Garcı́a, D., & Wolf, M. M. (2025) · Physics Reports · doi:10.1016/j.physrep.2025.06.004 · Cited by 12 · see citing works
Undecidability and Quantum Mechanics
Noce, C., & Romano, A. (2022) · Encyclopedia · doi:10.3390/encyclopedia2030103 · Cited by 4 · see citing works
QUANTUM INFORMATION, THERMOFIELD DYNAMICS AND THERMALIZED BOSONIC OSCILLATOR
Trindade, M. A. S., Filho, L. M. S., dos Santos, L. C., MARTINS, M. G. R., & Vianna, J. D. M. (2013) · International Journal of Modern Physics B · doi:10.1142/s0217979213501336 · Cited by 3 · see citing works
On a New Basis for a Generalized Clifford Algebra and its Application to Quantum Mechanics
Granik, A., & Ross, M. F. (1996) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4615-8157-4_6 · Cited by 3 · see citing works
Undecidability of the spectral gap in rotationally symmetric Hamiltonians
Castilla-Castellano, L., & Lucia, A. (2025) · Physical Review Research · doi:10.1103/5lrn-h3cg · Cited by 1 · see citing works
Physical Realization of Harmonic Oscillator Quantum Computer
Lu, J. (2012) · Lecture notes in electrical engineering · doi:10.1007/978-3-642-27311-7_5 · Cited by 1 · see citing works
Benioff, P. A. (1997) · Physical review. B, Condensed matter · doi:10.1103/physrevb.55.9482 · Cited by 3 · see citing works
Finite cyclic quantum state machines: a topological perspective
Parks, A. (2001) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/34/28/309
- Authors
- Lloyd, S.
- Affiliations
- Los Alamos National Laboratory (US)
- Corresponding author
- Lloyd, Seth
- ORCID
- Lloyd, Seth
- Venue
- Journal of Modern Optics
- Publisher
- Informa UK Limited
- Published
- 1994-12
- Volume
- 41
- Issue
- 12
- Pages
- 2503-2520
- ISSN
- 0950-0340 (ISSN-L)
- 1362-3044
- OpenAlex
- W2004230505
- Cited by
- 19
- References
- 30
- Citations by year
- 2025: 2 · 2024: 1 · 2022: 2 · 2020: 1 · 2018: 1 · 2013: 1 · 2012: 1
- FWCI
- 2.57
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Journal of Modern Optics (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Keywords
- quantum computing, universal quantum computer, necessary and sufficient conditions, uncomputability
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