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 141
Fundamental Limitations in the Computational Process
Landauer, R. W. (1976) · Berichte der Bunsengesellschaft für physikalische Chemie · doi:10.1002/bbpc.19760801105 · Cited by 48
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
Quantum mechanical Hamiltonian models of discrete processes
Benioff, P. A. (1981) · Journal of Mathematical Physics · doi:10.1063/1.524938 · Cited by 20
Self-citationIrreversibility, uncertainty, relativity and computer limitations
Mundici, D. (1981) · Il Nuovo cimento della Società italiana di fisica. B/Il Nuovo cimento B · doi:10.1007/bf02721331 · Cited by 16
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
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.