Quantum mechanical Hamiltonian models of discrete processes that erase their own histories: Application to Turing machines
The DOI matches its Crossref record; 19 of the 20 references it cites were found in a registry or an index.
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 connection between orthogonality and rate of information processing has previously been discussed[12,2,7,13,14,4], but no universal bound on computation rate was proposed.”
From The maximum speed of dynamical evolution (1998) · cites this paper as [2]
Citations
Cites
Mathematical Foundations of Quantum Mechanics: New Edition
von Neumann, J. (2018) · Princeton University Press eBooks · doi:10.1515/9781400889921 · Cited by 4,582
Scattering Theory of Waves and Particles
Newton, R. G. (1982) · Springer eBooks · doi:10.1007/978-3-642-88128-2 · Cited by 4,212 · cited 1×
“Under the eikonal approximation ( Newton, 1966: Schiff, 1968) which requires that V(x) change little over a distance l/k, ~z+~(x) is given by (Benioff, I981)”
MethodLogical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679
Schiff, L. I. (1949) · Cited by 3,018
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
Harmonic Analysis of Operators on Hilbert Space
Szõkefalvi-Nagy, B., Foiaş, C., Bercovici, H., & Kérchy, L. (1970) · REAL-EOD (Library of the Hungarian Academy of Sciences and the Information Center Oriental Collection) · Cited by 2,174
Scattering theory of waves and particles
Breit, G. (1967) · Journal of the Franklin Institute · doi:10.1016/0016-0032(67)90450-4 · Cited by 2,049
1. Foundations of quantum mechanics
(2019) · Vibrational Spectroscopy · doi:10.1515/9783110625097-001 · Cited by 1,664
Schiff, L. I., & Gardner, J. H. (1973) · American Journal of Physics · doi:10.1119/1.1987309 · Cited by 1,398
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
Self-citation
Research works printed but not linked: 2
- Bell, J. S. (1975).Helvetica Physica Acta,48, 93.
- Hepp, K. (1972).Helvetica Physica Acta,45, 237.
Cited by
Items 101–118 of 118
(1993) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789814503563_bmatter
Quantum Automata with Open Time Evolution
Hirvensalo, M. (2012) · IGI Global eBooks · doi:10.4018/978-1-4666-1574-8.ch004
Zurek, W. H. (2018) · CRC Press eBooks · doi:10.1201/9780429502880-8
Physics, Information, and Computation
Li, M., & Vitanyi, P. M. B. (1997) · Springer eBooks · doi:10.1007/978-1-4757-2606-0_8
(1992) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)70025-9
Introduction to Quantum Optimization
Moraglio, A., & Chicano, F. (2023) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3583133.3595040
Hamiltonian Minimization in the NISQ EraPreprint
da Silva, R. P. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4652979
Oracle Quantum Algorithms: An OverviewPreprint
da Silva, R. P. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4862127 · Cited by 1
Ferry, D. K. (2024) · Synthesis lectures on engineering, science, and technology · doi:10.1007/978-3-031-62925-9_1
Introduction to Quantum Optimization
Moraglio, A., & Chicano, F. (2024) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3638530.3648420
Introduction to Quantum Optimization
Moraglio, A., & Chicano, F. (2025) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3712255.3716508
Theory of Quantum Computing and its Analog of the Halting ProblemPreprint
Hopanchuk, A. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5393476
Quantum Machine Learning Applied to the Sinking of the TitanicPreprint
Santos, L. H., Chinaglia, E. F., Curado, J. F., Guazzelli, M. A., Pojar, M., Masunaga, S. H., & Santos, R. B. B. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2509.00916
Refining quantum algorithms for each era of quantum computing
Meister, R. (2023) · Oxford University Research Archive (ORA) (University of Oxford) · doi:10.5287/ora-xvrj2pxa7
Nuemnann, N. M. P. (2025) · TNO Repository
Solving Quantum Many-Body Problems on Quantum Computers
Martin, B. A. (2023) · theses.fr (ABES) · doi:10.70675/911dc194ze97bz42d2z8611z3daf90a7419c · Cited by 2
Introduction to Quantum Optimization
Moraglio, A., & Chicano, F. (2026) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3795101.3807751
Physical systems for the solution of hard computational problems
Mattsson, P. (2003)
Metadata
- Authors
- Benioff, P. A.
- Affiliations
- Argonne National Laboratory (US)
- Corresponding author
- Benioff, Paul A.
- Venue
- International Journal of Theoretical Physics
- Published
- 1982-04
- Volume
- 21
- Issue
- 3-4
- Pages
- 177-201
- ISSN
- 0020-7748 (ISSN-L)
- 1572-9575
- OpenAlex
- W2065184494
- Cited by
- 113
- References
- 20
- Citations by year
- 2026: 1 · 2025: 2 · 2024: 4 · 2023: 6 · 2022: 1 · 2021: 1 · 2020: 4 · 2019: 1 · 2018: 1 · 2017: 1 · 2016: 2 · 2015: 3 · 2014: 5 · 2013: 4 · 2012: 4
- FWCI
- 8.02
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- International Journal of Theoretical Physics (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 › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- Turing machines, discrete processes, fixed points, ballast system, quantum computing
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.