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
Quantum walks: a comprehensive review
Venegas-Andraca, S. E. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0432-5 · Cited by 934
“g [66,69,68,67,155,156,154,130,131,162,315].”
Reversible logic and quantum computers
Peres, A. (1985) · Physical Review A · doi:10.1103/physreva.32.3266 · Cited by 892
The maximum speed of dynamical evolution
Margolus, N., & Levitin, L. B. (1998) · Physica D: Nonlinear Phenomena · doi:10.1016/s0167-2789(98)00054-2 · Cited by 887
“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.”
BackgroundExperimental Implementation of Fast Quantum Searching
Chuang, I. L., Gershenfeld, N., & Kubinec, M. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.3408 · Cited by 707
Quantum walks: a comprehensive reviewPreprint
Venegas-Andraca, S. E. (2012) · Cited by 532
Complexity as thermodynamic depth
Lloyd, S., & Pagels, H. (1988) · Annals of Physics · doi:10.1016/0003-4916(88)90094-2 · 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
Bennett, C. H., Gacs, P., Li, M., Vitanyi, P. M. B., & Zurek, W. H. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.681318 · Cited by 506
Quantum mechanical Hamiltonian models of Turing machines
Benioff, P. (1982) · Journal of Statistical Physics · doi:10.1007/bf01342185 · Cited by 402
“(15) This discussion also applies to the time-dependent model except that one has 3J < n < 3N v.”
BackgroundSelf-citationInvertible cellular automata: A review
Toffoli, T., & Margolus, N. H. (1990) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(90)90185-r · Cited by 376
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
Valiant, L. G. (2002) · SIAM Journal on Computing · doi:10.1137/s0097539700377025 · Cited by 311
Quantum limits to the flow of information and entropy
Pendry, J. B. (1983) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/16/10/012 · Cited by 278
“The work in recent years on reversible computation (Benioff 1982, Landauer 1982) points to the need for careful re-examination of the prevalent assumption that the energy in a message must be dissipated.”
BackgroundUltimate Computing: Biomolecular Consciousness and NanoTechnology
Hameroff, S. R. (1987) · CERN Document Server (European Organization for Nuclear Research) · Cited by 189
Quantum Walks for Computer Scientists
Venegas-Andraca, S. E. (2008) · Synthesis lectures on quantum computing · doi:10.1007/978-3-031-02511-2 · Cited by 133
Reversibility and Stability of Information Processing Systems
Zurek, W. H. (1984) · Physical Review Letters · doi:10.1103/physrevlett.53.391 · Cited by 92
Unleashing the power of disruptive and emerging technologies amid COVID-19: A detailed reviewPreprint
Agarwal, S., Punn, N. S., Sonbhadra, S. K., Tanveer, M., Nagabhushan, P., Pandian, K. K. S., & Saxena, P. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.11507 · Cited by 106
“heory, computer science, and quantum physics together for faster computation compared to the conventional one [180]. This began with P. Benioff who was the first to theorize quantum computing in 1981 [21] and expanded into incredibly powerful machines that make use of the new approaches for processing information. Fig…”
BackgroundQuantum computers that can be simulated classically in polynomial time
Valiant, L. G. (2001) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/380752.380785 · Cited by 163
Uncertainty principle and minimal energy dissipation in the computer
Landauer, R. W. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857731 · Cited by 100
Quantum Walks for Computer Scientists
Venegas-Andraca, S. E. (2008) · Synthesis lectures on quantum computing · doi:10.2200/s00144ed1v01y200808qmc001 · Cited by 90
Quantum Automata with Open Time Evolution
Hirvensalo, M. (2010) · International Journal of Natural Computing Research · doi:10.4018/jncr.2010010104 · Cited by 61
NREVERSAL of fortune — The thermodynamics of garbage collection
Baker, H. G. (2005) · Springer eBooks · doi:10.1007/bfb0017210 · Cited by 48
On the physical implementation of logical transformations: Generalized L -machines
Anderson, N. G. (2010) · Theoretical Computer Science · doi:10.1016/j.tcs.2010.06.015 · Cited by 43
“Another example is the addition of a ‘‘history tape’’ to a Turing machine, which enables reversible operation of the machine by creating and later accessing a record of the machine states visited during a computation [10–12].”
BackgroundQuantum Mechanical Hamiltonian Models of Computersa
Benioff, P. A. (1986) · Annals of the New York Academy of Sciences · doi:10.1111/j.1749-6632.1986.tb12450.x · Cited by 49
Self-citationFuture of Quantum Computing in Cyber Security
Brijwani, G. N., Ajmire, P. E., & Thawani, P. V. (2023) · Advances in systems analysis, software engineering, and high performance computing book series · doi:10.4018/978-1-6684-6697-1.ch016 · Cited by 48
Linear and nonlinear mesoscopic thermoelectric transport with coupling with heat baths
Jiang, J., & Imry, Y. (2016) · Comptes Rendus Physique · doi:10.1016/j.crhy.2016.08.006 · Cited by 36
Optimal control theory for continuous-variable quantum gates
Wu, R.-B., Chakrabarti, R., & RABITZ, H. A. (2008) · Physical Review A · doi:10.1103/physreva.77.052303 · Cited by 35
D-Wave and predecessors: From simulated to quantum annealing
Cohen, E., & Tamir, B. (2014) · International Journal of Quantum Information · doi:10.1142/s0219749914300022 · Cited by 40
Fundamental Physical Limitations of the Computational Process
Landauer, R. W. (1984) · Annals of the New York Academy of Sciences · doi:10.1111/j.1749-6632.1984.tb16518.x · Cited by 37
Bibliographic guide to the foundations of quantum mechanics and quantum informationPreprint
Cabello, A. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0012089 · Cited by 34
“[Benioff 82 b]: P. A. Benioff, “Quantum mechanical Hamiltonian models of Turing machines”, J. Stat.”
BackgroundInfluentialThermodynamics of computation and information distance
Bennett, C. H., Gács, P., Li, M., Vitanyi, P. M. B., & Zurek, W. H. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167098 · Cited by 41
Commnet on "Dissipation in Computation"
Toffoli, T. (1984) · Physical Review Letters · doi:10.1103/physrevlett.53.1204 · Cited by 28
Balancing error and dissipation in computing
Riechers, P. M., Boyd, A. B., Wimsatt, G. W., & Crutchfield, J. P. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033524 · Cited by 24
“16 [53] Paul A.”
BackgroundPhysics of selective systems: Computation and biology
Rothstein, J. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857734 · Cited by 21
G-Complexity, Quantum Computation and Anticipatory Processes
Nadin, M. (2014) · PhilPapers (PhilPapers Foundation) · Cited by 20
Porod, W., Grondin, R., Ferry, D. K., & Porod, G. (1984) · Physical Review Letters · doi:10.1103/physrevlett.53.1206 · Cited by 24
Quantum annealing – foundations and frontiers
Cohen, E., & Tamir, B. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02345-1 · Cited by 20
Comment on "Dissipation in Computation"
Benioff, P. A. (1984) · Physical Review Letters · doi:10.1103/physrevlett.53.1203 · Cited by 22
Self-citationQuantum ballistic evolution in quantum mechanics: Application to quantum computers
Benioff, P. A. (1996) · Physical Review A · doi:10.1103/physreva.54.1106 · Cited by 21
Self-citationPersistence of entanglement in thermal states of spin systems
Sadiek, G., & Kais, S. (2013) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/46/24/245501 · Cited by 15
Hybrid Quantum-Classical Protocol for Storage and Retrieval of Discrete-Valued Information
Iliyasu, A. M., Venegas-Andraca, S. E., Yan, F., & Sayed, A. (2014) · Entropy · doi:10.3390/e16063537 · Cited by 13
“, [1–11]), being the rationale behind this approach that the concepts of information and computation can and must be built upon physical principles.”
BackgroundMaritime applications of quantum computation
Venegas-Andraca, S. E., Lanzagorta, M. O., & Uhlmann, J. K. (2015) · MTS/IEEE OCEANS Conference (OCEANS) · doi:10.23919/oceans.2015.7404356 · Cited by 13
“g [13], [16], [15], [14], [53], [19], [17], [20], [21], [22].”
Glenn, D. R., Lidar, D. A., & Apkarian, V. A. (2006) · Molecular Physics · doi:10.1080/00268970500525713 · Cited by 18
Landauer, R. W. (1994) · Cited by 12
Investigating Quantum Coherence by Negative Excursions of the Wigner Quasi-Distribution
Ballicchia, M., Ferry, D. K., Nedjalkov, M., & Weinbub, J. (2019) · Applied Sciences · doi:10.3390/app9071344 · Cited by 11
“The idea of using quantum mechanics to provide more computing power than classical computers seems to have begun around 1981-2 [1], but Deutsch put the ideas on a more firm basis a few years later [2].”
BackgroundQuantum Theory of Computation and Relativistic PhysicsPreprint
Vlasov, A. Y. (1997) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9701027 · Cited by 9
“The main purpose of the work is to consider essentially new properties of quantum computers [1, 2, 3, 4, 5] due to relativistic phenomena rather than some small corrections to nonrelativistic formulae.”
BackgroundEntanglement and quantum correlations in the honeycomb graphene lattice within the Hubbard model
Mhamdi, H., Jebli, L., Habiballah, N., & Nassik, M. (2024) · The European Physical Journal D · doi:10.1140/epjd/s10053-023-00782-7 · Cited by 9
Theory Of Thermodynamics Of Computation
Li, M., & Vitanyi, P. M. B. (2005) · Workshop on Physics and Computation (PhysComp) · doi:10.1109/phycmp.1992.615489 · Cited by 12
Quantum Computing and Cryptography: An Overview
Farouk, A., Tarawneh, O. H., Elhoseny, M., Batle, J. A. I., Naseri, M., Hassanien, A. E., & Abedl-Aty, M. (2017) · Studies in big data · doi:10.1007/978-3-319-63639-9_4 · Cited by 8
Factorizations and physical representations
Revzen, M., Khanna, F. C., Mann, A., & Žák, J. (2006) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/39/18/027 · Cited by 7
On Quantum Cellular AutomataPreprint
Vlasov, A. Y. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0406119 · Cited by 7
“2 and global transition function F may be written as composition of all local So instead of one instance of lattice L we have evolution with “generating a sequence of copies, history” as it is quite usual in theory of cellular automata [3], reversible classical [5], and quantum [6] computations.”
BackgroundLawrence, A. F., & Birge, R. R. (1984) · Springer eBooks · doi:10.1007/978-1-4613-2789-9_16 · Cited by 7
Zig-zag path to understanding [physical limits of information handling]
Landauer, R. W. (2002) · Workshop on Physics and Computation (PhysComp) · doi:10.1109/phycmp.1994.363699 · Cited by 6
“[29] where many of us discussed Benioff’s notions and the paper Benioff presented there [30].”
BackgroundQuantum Computation with Bose-Einstein CondensatesPreprint
Shi, Y. (1999) · arXiv (Cornell University) · Cited by 6
Single-spin implementation of a multiplexer
Bhattacharyya, T. K., Neogy, A., & Bhowmik, D. (2009) · Physica E Low-dimensional Systems and Nanostructures · doi:10.1016/j.physe.2009.01.019 · Cited by 5
Computing with quanta—impacts of quantum theory on computation
Hirvensalo, M. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00096-8 · Cited by 5
Trapped Ion Quantum Computer Research at Los Alamos
James, D. F. V., Gulley, M. S., Holzscheiter, M. H., Hughes, R., Kwiat, P. G., Lamoreaux, S. K., Peterson, C. G., Sandberg, V. D., Schauer, M. M., Simmons, C. M., et al. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49208-9_39 · Cited by 8
Internal entanglement amplification by external interactions
Peskin, U., Huang, Z., & Kais, S. (2007) · Physical Review A · doi:10.1103/physreva.76.012102 · Cited by 5
The Intractable and the Undecidable - Computation and Anticipatory Processes
Nadin, M. (2013) · International Journal of Applied Research on Information Technology and Computing · doi:10.5958/j.0975-8089.4.3.011 · Cited by 4
Condensates, B.-E., Hecht, T., Dr, P., & Cirac, J. I. (2015) · Cited by 4
Margolus, N. (2005) · Workshop on Physics and Computation (PhysComp) · doi:10.1109/phycmp.1992.615551 · Cited by 4
“But our best models of nature are quantum mechanical , and so it makes sense to try to find microscopic QM models of computation[4] [9] [8] [12] [18].”
Gate-based Quantum Computing: An OverviewPreprint
da Silva, R. P. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4347584 · Cited by 6
Dynamics of Entanglement In One‐ and Two‐Dimensional Spin Systems
Sadiek, G., Xu, Q. Y., & Kais, S. (2014) · Advances in chemical physics · doi:10.1002/9781118742631.ch15 · Cited by 4
Freire, O., & Greca, I. M. (2013) · Scientiae Studia · doi:10.1590/s1678-31662013000100002 · Cited by 8
Unitary dilation models of Turing machines in quantum mechanics
Benioff, P. A. (1995) · Physical Review A · doi:10.1103/physreva.51.3513 · Cited by 3
Self-citationApplications of algebraic automata theory to quantum finite automata
Mercer, M. (2007) · eScholarship@McGill (McGill) · doi:10.82308/31455 · Cited by 4
The DiQuNET Architecture for the Control of Quantum Processors: The Case Study of Trapped Ions
Castillo, S. (2026) · IEEE Access · doi:10.1109/access.2026.3665594 · Cited by 2
2D Material-based Quantum Logic Gate Operating Via Self-Organization of Quantum Dots
Voronov, V. K., Dudareva, O. V., & Gerashchenko, L. A. (2020) · Global Journal of Human Social Science · doi:10.34257/gjsfravol20is8pg13 · Cited by 3
Nanoelectronic Systems for Quantum Computing
Ferry, D. K. (2022) · Springer handbooks · doi:10.1007/978-3-030-79827-7_33 · Cited by 2
Natural limitations of decision procedures for arithmetic with bounded quantifiers
Mundici, D. (1983) · Archive for Mathematical Logic · doi:10.1007/bf02023011 · Cited by 2
Stolze, J., & Suter, D. (2004) · Wiley eBooks · doi:10.1002/9783527617760.ch2 · Cited by 2
Mathematics for Quantum Information Processing
Hirvensalo, M. (2012) · Springer eBooks · doi:10.1007/978-3-540-92910-9_41 · Cited by 4
Computation And Quantum Superposition
Jozsa, R. (2005) · Workshop on Physics and Computation (PhysComp) · doi:10.1109/phycmp.1992.615537 · Cited by 2
Algebra, Logic and Qubits: Quantum AbacusPreprint
Vlasov, A. Y. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0001100 · Cited by 2
“The bounded quantum Turing machine [7] also uses other elements and more than one tape and in addition to the property it should be mentioned that T∗(H) maybe more appropriate for description of semi-infinite Turing tape with necessity of extension of the summation in Eq.”
MethodClifford algebras, noncommutative tori and universal quantum computersPreprint
Vlasov, A. Y. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0109010 · Cited by 2
“ar X iv :q ua nt -p h/ 01 09 01 0v 1 3”
Zhang, Y., Luo, J. L., Li, X., Fu, L.-P., Jian-qing, Q., Zeng, X., & Ye, C. (1999) · Chinese Physics Letters · doi:10.1088/0256-307x/16/9/026 · Cited by 2
Adaptive Quantum Computers: decoding and state preparationPreprint
Neumann, N. M. P. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2509.08718 · Cited by 2
Quantum computers? … Coherent computers!
Oraevsky, A. N. (2001) · Optics and Spectroscopy · doi:10.1134/1.1405225 · Cited by 1
The 1980s and Early 1990s, Research on Foundations Takes Off
Freire, O. (2014) · Springer eBooks · doi:10.1007/978-3-662-44662-1_8 · Cited by 1
Quantum and Biocomputing – Common Notions and Targets
Hirvensalo, M. (2013) · Springer eBooks · doi:10.1007/978-3-642-30574-0_59 · Cited by 1
Dissipation and irreversibility in computing
Ferry, D. K., & Porod, W. (2023) · Materials Research Express · doi:10.1088/2053-1591/acebba · Cited by 1
Artificial Physics: The Soul Of A new discipline
Leão, J. (2005) · Workshop on Physics and Computation (PhysComp) · doi:10.1109/phycmp.1992.615481 · Cited by 1
Quantum Information Science and NanotechnologyPreprint
Vlasov, A. Y. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0903.1204 · Cited by 1
“Benioff [9] on conference PhysComp (Physics and Computations) in 1981.”
BackgroundProgress Towards Using a Calcium Ion Trap to Perform Quantum Logic Operations
Gulley, M. S., Gómez, J. J., Holzscheiter, M. H., James, D. F. V., Kwiat, P. G., Lamoreaux, S. K., Peterson, C. G., Sandberg, V., Schauer, M. M., Simmons, C. M., et al. (2005) · Kluwer Academic Publishers eBooks · doi:10.1007/0-306-47097-7_37 · Cited by 1
Quantum Information Science from the Perspective of a Device and Materials Engineer
Bandyopadhyay, S. (2003) · Elsevier eBooks · doi:10.1016/b978-012507060-7/50014-3 · Cited by 2
Quantum computation and NP-complete problems: Extended abstract
Mihara, T., & Nishino, T. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58325-4_203 · Cited by 2
“In early models of quantum computers such as those of P. A. Benioff[ 3 ], researchers placed a great importance on finding a precise representration of Turing Machines based on quantum physics.”
BackgroundSome Notes on Quantum Information Theory and Emerging Computing TechnologiesPreprint
Vlasov, A. Y. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1102.2890 · Cited by 1
“−t is valid operation. So the understanding of possibility to implement universal computer using reversible devices [1] was important for development of first models of the quantum comp uting machines [2]. Reversible computation is also actively studied because according to Landauer principle [3] heat generation may be…”
BackgroundMethodOn Ultimate Thermodynamic Limitations in Communication and Computation
Rothstein, J. (1988) · Springer eBooks · doi:10.1007/978-94-009-2794-0_3 · Cited by 1
Quantum variational optimization methods and their applications
Chatterjee, Y. (2024) · theses.fr (ABES) · doi:10.70675/a5ad5ad8z217az422az9443zcb2788cbc504 · Cited by 3
Physics of Computation: From Classical to Quantum
Thomas, H. (2002) · Springer eBooks · doi:10.1007/978-94-010-0419-0_1
Quantum Plasmonics: From Quantum Statistics to Quantum Interferences
Martino, G. D. (2016) · Reviews in plasmonics · doi:10.1007/978-3-319-24606-2_12
Information Nano-Technologies: Transition from Classical to QuantumPreprint
Vlasov, A. Y. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0912.0829
The Differential Scheme and Quantum Computation
Irwin, R. J. (2011) · Syracuse University Libraries (Syracuse University)
Very Large‐scale Simulation Of Physical Systems
Boghosian, B. M. (2003) · Wiley eBooks · doi:10.1002/3527600434.eap558
Quantum Computing and Information Acquisition
Tarn, T., & Ganesan, N. (2007) · International Symposium on Micro-NanoMechatronics and Human Science · doi:10.1109/mhs.2007.4420911
The near-field effect in a quantum computer
Gadomskiĭ, O. N., & Voronov, Y. Y. (1999) · Journal of Experimental and Theoretical Physics Letters · doi:10.1134/1.568094
Advances in Quantum Computing and Control
Tarn, T. (2002) · International Journal of Nonlinear Sciences and Numerical Simulation · doi:10.1515/ijnsns.2002.3.3-4.751
Continuous history variable for programmable quantum processorsPreprint
Vlasov, A. Y. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1006.3671
“The quantum mechanical model of such device is quite straightforward [8].”
BackgroundPhysics, Information, and Computation
Li, M., & Vitanyi, P. M. B. (2008) · Texts in computer science · doi:10.1007/978-0-387-49820-1_8
Time Evolution of Electronic States in Microclusters
Hamada, N. (1987) · Springer series in materials science · doi:10.1007/978-3-642-83064-8_24
Hoofnagle, C. J., & Garfinkel, S. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108883719.016
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.