The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Quantum Mechanical Models of Turing Machines That Dissipate No Energy
Abstract
Quantum mechanical Hamiltonian models of Turing machines are constructed here on a finite lattice of spin-\textonehalf{} systems. The models do not dissipate any energy and they operate at the quantum limit in that the system (energy uncertainty)/(computation speed) is close to the limit given by the time-energy uncertainty principle.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
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
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
Self-citationMinimal Energy Dissipation in Logic
Keyes, R. W., & Landauer, R. (1970) · IBM Journal of Research and Development · doi:10.1147/rd.142.0152 · Cited by 265
Energy cost of information transfer
Bekenstein, J. D. (1981) · Physical Review Letters · doi:10.1103/physrevlett.46.623 · Cited by 252
Classical and quantum limitations on energy consumption in computation
Likharev, K. K. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857733 · Cited by 155
Fundamental Limitations in the Computational Process
Landauer, R. W. (1976) · Berichte der Bunsengesellschaft für physikalische Chemie · doi:10.1002/bbpc.19760801105 · Cited by 51
Physical limitations of rate, depth, and minimum energy in information processing
Levitin, L. B. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857732 · Cited by 45
Is There a Fundamental Bound on the Rate at Which Information Can Be Processed?
Deutsch, D. (1982) · Physical Review Letters · doi:10.1103/physrevlett.48.286 · Cited by 40
Minimal Energy Dissipation and Maximal Error for the Computational Process
Landauer, R. W., & Woo, J. W. F. (1971) · Journal of Applied Physics · doi:10.1063/1.1660540 · Cited by 36
Cited by
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Measurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Steane, A. (1998) · Reports on Progress in Physics · doi:10.1088/0034-4885/61/2/002 · Cited by 1,391
Ultimate physical limits to computation
Lloyd, S. (2000) · Nature · doi:10.1038/35023282 · Cited by 1,120
Quantum walks: a comprehensive review
Venegas-Andraca, S. E. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0432-5 · Cited by 934
Landauer, R. (1991) · Physics Today · doi:10.1063/1.881299 · Cited by 804
Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
Abrams, D. S., & Lloyd, S. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.2586 · Cited by 745
Almost Any Quantum Logic Gate is Universal
Lloyd, S. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.346 · Cited by 690
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649
Quantum information processing with atoms and photons
Monroe, C. (2002) · Nature · doi:10.1038/416238a · Cited by 627
Information and computation: Classical and quantum aspects
Galindo, A., & Martín-Delgado, M. A. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.347 · Cited by 552
Complexity as thermodynamic depth
Lloyd, S., & Pagels, H. (1988) · Annals of Physics · doi:10.1016/0003-4916(88)90094-2 · Cited by 517
The physical nature of information
Landauer, R. (1996) · Physics Letters A · doi:10.1016/0375-9601(96)00453-7 · Cited by 517
Simulating physics with cellular automata
Vichniac, G. Y. (1984) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(84)90253-7 · Cited by 500
Quantum automata and quantum grammars
Moore, C., & Crutchfield, J. P. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(98)00191-1 · Cited by 406
Quantum annealing for industry applications: introduction and review
Yarkoni, S., Raponi, E., Bäck, T., & Schmitt, S. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac8c54 · Cited by 341
“It was first introduced in the early 1980s by physicist Paul Benioff [13, 14] and independently by Richard Feynman [56].”
Multiphoton quantum optics and quantum state engineering
Dell’Anno, F., De Siena, S., & Illuminati, F. (2006) · Physics Reports · doi:10.1016/j.physrep.2006.01.004 · Cited by 310
Spin-based quantum computers made by chemistry: hows and whys
Stamp, P. C. E., & Gaita-Ariño, A. (2009) · J. Mater. Chem. · doi:10.1039/b811778k · Cited by 277
General Quantum Interference Principle and Duality Computer
Gui-Lu, L. (2006) · Communications in Theoretical Physics · doi:10.1088/0253-6102/45/5/013 · Cited by 264
DNA molecule provides a computing machine with both data and fuel
Benenson, Y., Adar, R., Paz-Elizur, T., Livneh, Z., & Shapiro, E. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0535624100 · Cited by 255
Harnessing the Power of the Second Quantum Revolution
Deutsch, I. H. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020101 · Cited by 207
Quantum Hamiltonian Complexity
Gharibian, S., Huang, Y., Landau, Z., & Shin, S. W. (2015) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000066 · Cited by 144
Landauer, R. (1995) · Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences · doi:10.1098/rsta.1995.0106 · Cited by 124
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
Quantum-resistance in blockchain networks
Allende, M., León, D. L., Cerón, S., Pareja, A., Pacheco, E., Leal, A., Da Silva, M., Pardo, A., Jones, D., Worrall, D. J., et al. (2023) · Scientific Reports · doi:10.1038/s41598-023-32701-6 · Cited by 109
“Quantum computing, one of the most recent cross-pollination efforts between physics and computer science, is a scientific and engineering field focused on developing information processing devices and algorithms based on quantum mechanics [1–7].”
BackgroundDigital-analog quantum computation
Parra-Rodriguez, A., Lougovski, P., Lamata, L., Solano, E., & Sanz, M. (2020) · Physical Review A · doi:10.1103/physreva.101.022305 · Cited by 104
Metadata
- Authors
- Benioff, P.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 1982-06-07
- Volume
- 48
- Issue
- 23
- Pages
- 1581-1585
- ISSN
- 0031-9007 (ISSN-L)
- OpenAlex
- W2000201689
- Cited by
- 295
- References
- 12
- FWCI
- 4.27
- Type
- journal article
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.