The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
Overview
Integrity signals
Registry
Cites
Statistics
Verification
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?
In the citing paper
“The quantum computational cost of these algorithms has continued to be reduced 47-50 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [48]
Citations
Cites
Perturbation Theory for Linear Operators
Kato, T. (1995) · Classics in Mathematics · doi:10.1007/978-3-642-66282-9 · Cited by 16,290
Perturbation theory for linear operators
Kato, T. (1966) · Springer eBooks · doi:10.1007/978-3-662-12678-3 · Cited by 7,131 · cited 1×
“Equations ( 20 ), (24), and (26) show that an appropriate description of the calculation can be given by a time-dependent Hamittonian He(t ) which becomes //1 e, H~ e, and Ha e in successive time intervals 0-~/2, ~/2-~r, 7r-3~r/2, etc.”
BackgroundIrreversibility 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
Mathematical Foundations of Quantum Mechanics: New Edition
von Neumann, J. (2018) · Princeton University Press eBooks · doi:10.1515/9781400889921 · Cited by 4,582
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679
Mathematical foundations of quantum mechanics
Offenbacher, E. L. (1955) · Journal of the Franklin Institute · doi:10.1016/0016-0032(55)90752-3 · Cited by 2,930
Theory of Recursive Functions and Effective Computability.
Feferman, S., & Rogers, H. (1969) · The American Mathematical Monthly · doi:10.2307/2316720 · Cited by 2,788
Irreversibility and heat generation in the computing process
Landauer, R. (2000) · IBM Journal of Research and Development · doi:10.1147/rd.441.0261 · Cited by 2,585
Theory of Recursive Functions and Effective Computability
Cooper, D. C. (1969) · The Computer Journal · doi:10.1093/comjnl/12.1.28 · Cited by 2,539
Theory of Recursive Functions and Effective Computability
Rogers, J. H. (1987) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,998
The Radiation Theories of Tomonaga, Schwinger, and Feynman
Dyson, F. J. (1949) · Physical Review · doi:10.1103/physrev.75.486 · Cited by 1,383
Time, structure, and fluctuations
Prigogine, I. (1978) · Science · doi:10.1126/science.201.4358.777 · Cited by 1,148
Computability and Unsolvability.
Elgot, C., & Davis, M. (1959) · Mathematical Tables and Other Aids to Computation · doi:10.2307/2002808 · Cited by 980
The Mathematical Foundations of Quantum Mechanics
Mackey, G. W., & Danos, M. (1964) · Physics Today · doi:10.1063/1.3051542 · Cited by 589
Quantum theory of measurement and macroscopic observables
Hepp, K. (1972) · E-Periodica · doi:10.5169/seals-114381 · Cited by 302
Minimal 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
Relativistic Quantum Field Theory
Schwinger, J. (1966) · Science · doi:10.1126/science.153.3739.949 · Cited by 225
Role of the Observer in Quantum Theory
Shimony, A. (1963) · American Journal of Physics · doi:10.1119/1.1969073 · Cited by 178
Wilder, J. (1962) · American Journal of Psychotherapy · doi:10.1176/appi.psychotherapy.1962.16.2.326 · Cited by 162
On wave packet reduction in the Coleman–Hepp model
Bell, J. S. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511815676.008 · Cited by 126
Fidelity in Mathematical Discourse: Is One and One Really Two?
Davis, P. J. (1972) · American Mathematical Monthly · doi:10.2307/2316620 · Cited by 76
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
Include the Observer in the Wave Function?
WHEELER, J. A. (1977) · Springer eBooks · doi:10.1007/978-94-010-1196-9_1 · Cited by 36
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
Fidelity in Mathematical Discourse: Is One and One Really Two?
Davis, P. J. (1972) · American Mathematical Monthly · doi:10.1080/00029890.1972.11993025 · Cited by 30
Models in nonequilibrium quantum statistical mechanics
Dresden, M., & Feiock, F. D. (1972) · Journal of Statistical Physics · doi:10.1007/bf01008547 · Cited by 19
Illustrative calculations using projection techniques
Muriel, A. (1977) · American Journal of Physics · doi:10.1119/1.10777 · Cited by 4
Research works printed but not linked: 3
- G. Emch,Helv. Phys. Acta 45:1049 (1972); Whitten-Wolfe and G. Emch,Helv. Phys. Acta 49:45 (1976).
- J. S. Bell,Helv. Phys. Acta 48:93 (1975).
- K. Hepp,Helv. Phys. Acta 45:237 (1972).
Cited by
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
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
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Metadata
- Authors
- Benioff, P.
- Affiliations
- Centre National de la Recherche Scientifique (FR)
- Corresponding author
- Benioff, Paul
- Venue
- Journal of Statistical Physics
- Published
- 1980-05
- Volume
- 22
- Issue
- 5
- Pages
- 563-591
- ISSN
- 0022-4715 (ISSN-L)
- 1572-9613
- OpenAlex
- W2085426595
- Cited by
- 1,244
- References
- 27
- Citations by year
- 2026: 58 · 2025: 111 · 2024: 111 · 2023: 138 · 2022: 117 · 2021: 92 · 2020: 72 · 2019: 34 · 2018: 34 · 2017: 33 · 2016: 32 · 2015: 23 · 2014: 11 · 2013: 12 · 2012: 23
- FWCI
- 4.48
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Journal of Statistical Physics (publishedVersion)
- Funders
- Centre National de la Recherche Scientifique
- 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 › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- Turing machines, Hamiltonian model, quantum state evolution
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.