The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
The DOI matches its Crossref record; 27 of the 27 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 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
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
Items 801–900 of 1,003
Harris, V. G., & Andalib, P. (2024) · Frontiers in Materials · doi:10.3389/fmats.2024.1343005 · Cited by 2
Yavuz, B. (2024) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3693-5533-6.ch004 · Cited by 2
Zhou, Y., Wong, Y. K., & Liang, Y. (2024) · International Conference on Digital Image Processing · doi:10.1117/12.3037909 · Cited by 2
“Quantum Information Processing was initially introduced by Paul Benioff in 1980 6 and later popularized by Richard Feynman with his groundbreaking paper on simulating physics using computers in 1982, 7 became an extremely ideal solution in the future.”
Velayatipour, M., Mosleh, M., Nejad, M. Y., & Kheyrandish, M. (2025) · Computing · doi:10.1007/s00607-025-01422-1 · Cited by 2
“Quantum computing leverages distinctive advantages and employs specialized techniques to tackle problems that may be overwhelming to address via classical computation methods [4].”
Yamada, S., Shigemoto, I., Kawakami, T., Isobe, H., Shoji, M., Miyagawa, K., & Yamaguchi, K. (2025) · Chemistry · doi:10.3390/chemistry7020038 · Cited by 3
kNN classification using Hausdorff metric with quantum-based Euclidean distance
Luna-Márquez, D. C., Pinto-Elías, R., Pérez-Becerra, T., Magadán-Salazar, A., González-Franco, N., & Fuentes-Pacheco, J. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00275-3 · Cited by 2
“Notable figures in the field, including (Benioff 1980, 1982; Wiesner 1983; Manin 1980; Feynman 1982), and Deutsch (Deutsch and Penrose 1985), have acknowledged the limitations of classical computational models and proposed quantum mechanical computation models that encompass a significantly larger…”
Entangling Problem Hamiltonian for Adiabatic Quantum Computation
Lychkovskiy, O. V. (2022) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080222100262 · Cited by 2
“[2] Paul Benioff, “The computer as a physical system: A microscopic quantum mechanical hamiltonian model of computers as represented by turing machines,” Journal of statistical physics 22, 563–591 (1980).”
BackgroundQuantum Algorithms and Methods
Djordjević, I. B. (2021) · Elsevier eBooks · doi:10.1016/b978-0-12-821982-9.00006-x · Cited by 2
Quantum Technologies I: Information, Communication, and Computation
Peláez, E., Pham, M., & Utagi, S. (2022) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-3-031-04613-1_1 · Cited by 2
Contributions of Quantum Factoring on Quantum Research
Ferner, C. S. (2022) · Computer · doi:10.1109/mc.2022.3178307 · Cited by 2
Dai, S. (2023) · International Journal of Quantum Information · doi:10.1142/s021974992350017x · Cited by 2
Novel Design of Quantum Circuits for Representation of Grayscale Images
Sarkar, M. (2023) · Lecture notes in networks and systems · doi:10.1007/978-981-19-8563-8_42 · Cited by 2
Quantum technology infrastructures for cybersecurity research
Costas, N., & Tato, A. G. (2023) · doi:10.23919/jnic58574.2023.10205660 · Cited by 2
“Finally, in 2001, the Shor algorithm was demonstrated experimentally, factoring number 15 [5].”
MethodQuantum algorithms for the simulation of perturbative QCD processes
Chawdhry, H. A., & Pellen, M. (2023) · International Symposium on Radiative Corrections (RADCOR) · doi:10.22323/1.432.0087 · Cited by 2
Meier, F., Huber, M., Erker, P., & Xuereb, J. (2026) · Reports on Progress in Physics · doi:10.1088/1361-6633/ae7b82 · Cited by 14
Aggarwal, S., Bharti, V., & Badhon, A. J. (2024) · Advances in systems analysis, software engineering, and high performance computing book series · doi:10.4018/978-1-7998-9522-0.ch001 · Cited by 2
Existence and uniqueness of solutions of the Koopman–von Neumann equation on bounded domains
Stengl, M., Gelß, P., Klus, S., & Pokutta, S. (2024) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad6f7d · Cited by 9
“Since the introduction of this paradigm by Benioff [Ben80], Manin [Man80], and in particular Feynman [Fey82] in the early 1980s, the interest in quantum computation and simulation has been growing continuously.”
Chachkarova, E., Tse, T., Yordanov, Y. S., Wei, Y., & Weber, C. (2025) · International Journal of Molecular Sciences · doi:10.3390/ijms26041550 · Cited by 2
“Quantum computing introduced a new approach to solving challenging computational problems that are difficult for classical computers [1,2].”
Quantum Zeno Monte Carlo for computing observables
Han, M., Park, H., & Choi, S. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01002-3 · Cited by 5
“Published in partnership with The University of New South Wales https://doi.org/10.1038/s41534-025-01002-3 The recent development of logical quantum processors marks a pivotal transition from the noisy intermediate-scale quantum (NISQ) era to the fault-tolerant quantum computing (FTQC) era.”
InfluentialSolving Unbounded Knapsack Problem Based on Quantum Genetic Algorithms
Chen, R.-C., Huang, Y.-H., & Lin, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12145-6_35 · Cited by 2
“Quantum mechanical computers were proposed in the early 1980s [1].”
BackgroundA Novel Quantum Genetic Algorithm for PID Controller
Wang, J., & Zhou, R. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14922-1_10 · Cited by 2
“The description of quantum mechanical computers was formalized in the late 1980s [1].”
BackgroundThe Quantum Computing Challenge
Vitanyi, P. M. B. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44577-3_15 · Cited by 2
Implementation of Grover's Quantum Search Algorithm with Two Trapped Cadmium Ions.
Brickman, K.-A. (2007) · Deep Blue (University of Michigan) · Cited by 4
COMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE
Dash, T., & Nayak, T. (2012) · Journal of Global Research in Computer Sciences · Cited by 2
One-way quantum finite automata together with classical states: Equivalence and Minimization
Qiu, D., Mateus, P., Zou, X., & Sernadas, A. (2009) · 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
Xiao, J., & Liu, B. (2009) · International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) · doi:10.1109/bicta.2009.5338071 · Cited by 2
“Quantum computing was proposed by Beniofl and Eeynman [8] [9] in the early 1980s as a new class of computing based on the concepts and principles of quantum theory.”
Chang, D., Zhao, Y., & Zheng, C. (2011) · International Conference on Intelligent Computation and Bio-Medical Instrumentation (ICBMI) · doi:10.1109/icbmi.2011.39 · Cited by 2
“Quantum mechanical computers were proposed in the early 1980s [6] and the description of quantum mechanical computers was formalized in the late 1980s' [7].”
BackgroundDynamic Quantum Crossover Based Clonal Selection Algorithm For Solving Traveling Salesman Problem
Dai, H., Yu, Y., & Li, C. (2011) · INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences · doi:10.4156/aiss.vol3.issue11.25 · Cited by 2
“Quantum computation, a novel inter-discipline that includes quantum mechanics and information science, was proposed by Benioff and Feynman in the early 1980s[1], [7].”
BackgroundQuantum Information and Nuclear Magnetic Resonance Parameters
Lino, J. B. D. R., & Ramalho, T. C. (2018) · Revista Virtual de Química · doi:10.21577/1984-6835.20180067 · Cited by 2
Application of Isotopic Materials Science in Bulk and Low-Dimensional Structures
Plekhanov, V. G. (2018) · Springer series in materials science · doi:10.1007/978-3-319-42261-9_4 · Cited by 2
Kulkarni, A. A., Bindal, N., & Kaushik, B. K. (2019) · IEEE Nanotechnology Magazine · doi:10.1109/mnano.2019.2927782 · Cited by 3
“QUANTUM COMPUTATION IN BRIEF The possibilities of computation with the help of quantum physics are elaborated in [7].”
BackgroundShin, Y. (2020) · American Journal of Physics and Applications · doi:10.11648/j.ajpa.20200803.12 · Cited by 2
“It is fundamental to understanding the wave nature of particles [13] and plays a central role in various practical applications, such as in radioactive disintegration [4-11], electron tunneling devices [12-15], quantum computation [16-22], and scanning tunneling microscopy [23-29].”
BackgroundWarke, A., & Thyagarajan, K. (2022) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-022-02936-9 · Cited by 3
Cloning and Beyond: A Quantum Solution to Duplicate Code
Jhaveri, S., Krone-Martins, A., & Lopes, C. V. (2023) · ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!) · doi:10.1145/3622758.3622889 · Cited by 7
“This possibility has been studied since the first early works and proposals by physicists and computer scientists pi-oneers such as Richard Feynman [25], Paul Benioff [11], Yuri Manin [52], David Deutsch [20], among others.”
BackgroundA Memcomputing Approach to Prime Factorization
Sharp, T. A., Khare, R., Pederson, E., & Traversa, F. L. (2023) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc60800.2023.10386235 · Cited by 2
“Quantum Computers [65], [66], [67], leveraging Shor’s algorithm [68], are considered a potential risk to RSA encryption [5].”
MethodQuantum Computing’s Path to Supremacy: Progress in the NISQ Epoch
Puthussery, E. S., & Poonia, R. C. (2024) · Lecture notes in networks and systems · doi:10.1007/978-981-97-3591-4_25 · 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
An adaptive quantum-based evolutionary algorithm for multiobjective optimization
Balicki, J. (2009) · Cited by 2
The quantum functional intermetallic compound Pr1−−La Pb Te
Herrmannsdörfer, T. (2005) · Current Applied Physics · doi:10.1016/j.cap.2005.01.035 · Cited by 2
Scattering theory in relation to quantum computing
Myers, J. M., & Wu, T. T. (2007) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.721693 · Cited by 2
“To achieve a general unitary transformation of a single qubit, that is an arbitrary transformation of the group SU(2), more than one scattering is required.”
BackgroundInterference as a computational resource: a tutorial
Hirvensalo, M. (2017) · Natural Computing · doi:10.1007/s11047-017-9654-x · Cited by 6
“It is certainly true that Benioff (1980) and Manin (1980) both introduced their quantum mechanical model of computing, but Feynman appears to be the first one to suggest that the computational complexity may depend on the underlying physical model—at least for some computational tasks.”
A Hybrid "Quantum and Classical" Method for Outlier Detection
Mazouzi, R., & Harel, P. (2020) · International Conference on Software and Computer Applications (ICSCA) · doi:10.1145/3384544.3384576 · Cited by 3
“This paradigm was introduced in the 1980s by Feyman [1] and Beinoff [2] and triggered a steady flow of papers addressing a variety of application fields including artificial intelligence and optimization.”
MethodCombarro, E. F., Nicolás, A. P., Ranilla, J., & Rúa, I. F. (2020) · Computational and Mathematical Methods · doi:10.1002/cmm4.1120 · Cited by 2
Coupled Oscillator Networks for von Neumann and Non-von Neumann Computing
Bonnin, M., Traversa, F. L., & Bonani, F. (2021) · Learning and analytics in intelligent systems · doi:10.1007/978-3-030-80571-5_11 · Cited by 2
A Converse for Fault-tolerant Quantum Computation
Uthirakalyani, G., Nayak, A. K., & Chatterjee, A. (2023) · Quantum · doi:10.22331/q-2023-08-16-1087 · Cited by 2
“INTRODUCTION The idea of a quantum computer was proposed in [1].”
BackgroundComputation And Quantum Superposition
Jozsa, R. (2005) · Workshop on Physics and Computation (PhysComp) · doi:10.1109/phycmp.1992.615537 · Cited by 2
Miao, X. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1105.3573 · Cited by 3
A Polynomial-Time Algorithm for the Equivalence between Quantum Sequential MachinesPreprint
Li, L., & Qiu, D. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0604085 · Cited by 2
“Quantum computers—the physical devices complying with the rules of quantum mechanics were first considered by Benioff [5], and then suggested by Feynman [15].”
BackgroundMethodInfluentialThe pre-history of quantum computation
Potgieter, P. H. (2004) · Suid-Afrikaanse Tydskrif vir Natuurwetenskap en Tegnologie · doi:10.4102/satnt.v23i1/2.186 · Cited by 2
Operation-induced decoherence by nonrelativistic scattering from a quantum memory
Margetis, D., & Myers, J. M. (2006) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/39/37/015 · Cited by 2
Physical Meaning Of Computation
Igeta, K. (2005) · Workshop on Physics and Computation (PhysComp) · doi:10.1109/phycmp.1992.615527 · Cited by 2
Modified Quantum Three Pass Protocol Based on Hybrid Cryptosystem
Abdullah, A. A. (2015) · Eastern Mediterranean University Institutional Repository (Eastern Mediterranean University) · Cited by 3
Sustaining Moore's Law Through InexactnessPreprint
Augustine, J. E., Palem, K. V., & Parishkrati (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.01497 · Cited by 2
“potentially radical models of computing have also emerged. Notable examples 1 arXiv:1705.01497v2 [cs.CC] 22 May 2017 include DNA [Adleman, 1994, Boneh et al., 1996], and quantum computing frameworks [Benioff, 1980, Feynman, 1982, Deutsch, 1985]. However, these exciting approaches and alternate models face a common and…”
BackgroundImproving post-quantum cryptography through cryptanalysis
Schanck, J. M. (2020) · UWSpace (University of Waterloo) · Cited by 6
Quantum logic as reversible computingPreprint
Evangelidis, B. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.07431 · Cited by 4
Quantum Computing in Operations ResearchPreprint
Creemers, S., & Armas, L. F. P. (2022) · SSRN Electronic Journal · doi:10.2139/ssrn.4198077 · Cited by 2
Annealing Quantum Computing: An OverviewPreprint
da Silva, R. P. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4501788 · Cited by 5
“Quantum computing is a field that harnesses quantum-mechanical phenomena to process information (Manin, 1980; Benioff, 1980; Feynman, 1982; Deutsch, 1985; Turchette et al., 1995; Lloyd, 1996; Mooij, 2004; Clark et al., 2015).”
BackgroundYu, W., Chen, Y., Zhang, C., Chen, Y., Wei, H., Chen, Z., & Zhang, Y. (2023) · Research Square · doi:10.21203/rs.3.rs-3562680/v1 · Cited by 2
Erasure Thresholds for Efficient Linear Optics Quantum ComputationPreprint
Silva, M. P. D. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0405112 · Cited by 4
“ansition from any given state sum up to 1. B.1 Transitions from [0,1] Pr([0,0]|[0,1]) = Pr(success|Z) (B.9a) Pr([1,0]|[0,1]) = δ (B.9b) Pr([1,1]|[0,1]) = (1−δ) 3 1 Pr(loss)[1−Pr(loss)]2 (B.9c) Pr([2,1]|[0,1]) = (1−δ) 2 3 3 2 [Pr(loss)]2[1−Pr(loss)] (B.9d) 80 Erasure Thresholds for Linear Optics B.2 Transitions from [1…”
BackgroundMethodInfluentialIntroduction to Quantum Algorithms
Sharif, S. (2025) · American Mathematical Monthly · doi:10.1080/00029890.2025.2476369 · Cited by 2
Card Game to Demonstrate Quantum Key Exchange
Ferner, C. S. (2023) · IT Professional · doi:10.1109/mitp.2023.3279688 · Cited by 2
On the relation between Bekenstein–Hawking entropy and Landauer’s principle
Song, D. (2024) · Modern Physics Letters A · doi:10.1142/s0217732324500664 · Cited by 1
Alinaghipour, R., & Mohammadi, H. (2024) · Physical Review A · doi:10.1103/physreva.110.032412 · Cited by 1
Quantum-Inspired Evolutionary Programming: A Case Study on Optimum Power Generation Scheduling
Ochi, A. R., Mahmud, S. G., & Margala, M. (2025) · IEEE Dallas Circuits and Systems Conference (DCAS) · doi:10.1109/dcas65331.2025.11045496 · Cited by 1
“Building on the work of Feynman [1],[2], Benioff [3], and others, it introduced qubits, leveraging quantum properties like superposition and entanglement for enhanced processing power.”
Das, A., Bhattacharya, M., & Datta, D. (2025) · Mathematical engineering · doi:10.1007/978-3-031-95693-5_7 · Cited by 1
Quantum and Classical Circuits
Thé, J. V. G., Fraser, R. A., & Rosas-Bustos, J. R. (2025) · Springer eBooks · doi:10.1007/978-3-031-98245-3_3 · Cited by 1
Sarkar, R. S., Chakraborty, S., & Adhikari, B. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00201 · Cited by 1
“Simulating the Hamiltonians of many-body systems is a highly anticipated achievement of quantum computers, first envisioned independently by Paul Benioff [4] and Yuri Manin [37], and later popularized by Richard Feynman [19].”
Belani, G., Kasina, P. K., Baig, M. Z., Vaddeboina, A. T., Nainwal, V., & Kumar, A. (2025) · IEEE India Council International Subsections Conference (INDISCON) · doi:10.1109/indiscon66021.2025.11252257 · Cited by 1
“Quantum information theory was developed [3], and Paul Benioff [4] and Richard Feynman [5] proposed models for quantum computers.”
Al-Janabi, T., Al-Raweshidy, H. S., & Zouri, M. (2026) · Sensors · doi:10.3390/s26030824 · Cited by 2
Transmon Qubit Designs Toward Giga‐Scale Integration
Zhang, S., Yao, Y., Pham, N. H., & Wu, D. (2026) · SmartSys · doi:10.1002/sys3.70016 · Cited by 1
Endohedral fullerenes as qubits: From synthesis to quantum computing applications
Nam, J., Han, J., Choi, J., Cho, F. H., Park, D. K., Park, S.-J., Hashikawa, Y., Murata, Y., Kwon, E., Kim, D., et al. (2026) · InfoMat · doi:10.1002/inf2.70158 · Cited by 1
How does adiabatic quantum computation fit into quantum automata theory?
Yamakami, T. (2021) · Information and Computation · doi:10.1016/j.ic.2021.104694 · Cited by 1
Möller, M. (2023) · Computational methods in applied sciences · doi:10.1007/978-3-031-29082-4_21 · Cited by 3
Geetha, P., Nanda, S. J., & Yadav, R. P. H. (2024) · SN Computer Science · doi:10.1007/s42979-024-02639-1 · Cited by 1
“In this example, the focus is on the convergence curve for Doppler frequency of 100 Hz, 200 Hz, with DOA of [ 50 , 60 ], with 100 snapshots and 500 iterations.”
Stengl, M. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04347-4 · Cited by 1
“Similar ideas have as well been formulated earlier, e.g., in the introduction of [11], in [1] and [13].”
Two-dimensional quantum central limit theorem by quantum walks
Asahara, K., Funakawa, D., Seki, M., & Suzuki, A. (2026) · Physical Review A · doi:10.1103/fs8d-h2z8 · Cited by 2
A binary integer programming-based method for qubit mapping in sparse architectures
Jiang, H., Fu, J., Deng, Y., & Wu, J. (2024) · Acta Informatica · doi:10.1007/s00236-024-00471-x · Cited by 1
“In 1980, Paul Benioff proposed the quantum mechanical model of Turing machines [2].”
Detectando un Espía con Criptografía Cuántica
Solar, M., Villacura, J.-P., Alvarez, F. C., & Dombrovskaia, L. (2024) · Memoria Investigaciones en Ingeniería · doi:10.36561/ing.27.13 · Cited by 1
de Santi, R. R. (2025) · IntechOpen eBooks · doi:10.5772/intechopen.1007572 · Cited by 2
Ukai, R., Yoshimura, C., & Mizuno, H. (2025) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.8351 · Cited by 1
Physical complexity and black hole quantum computers
Reilly, M., & Lloyd, S. (2025) · Journal of Physics Conference Series · doi:10.1088/1742-6596/3017/1/012010 · Cited by 3
“At the same time, Paul Benioff presented a reversible quantum model of computation [8].”
POPQC: Parallel Optimization for Quantum Circuits
Liu, P., Arora, J., Xu, M., & Acar, U. A. (2025) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/3694906.3743325 · Cited by 3
Singh, H., Majumder, S., & Mishra, S. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0289105 · Cited by 2
Belaloui, N. E., Tounsi, A., Khamadja, A. R., Benkadour, H., Louamri, M. M., Benslama, A., & Rouabah, M. T. (2025) · Physica Scripta · doi:10.1088/1402-4896/ae2f3e · Cited by 3
“Quantum methods, specifically quantum computing and quantum simulation, address the limitations of classical methods by natively leveraging quantum interactions [10, 11].”
McGarraghy, S., & Venkova, M. (2025) · Springer eBooks · doi:10.1007/978-3-032-00385-0_68 · Cited by 1
Mapping the quantum computing landscape: growth, collaboration, and thematic convergence
Conde-Torres, D., Seco-González, A., Piñeiro, Á., & Fandino, R. G. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00464-4 · Cited by 3
Quantum computing in transport science: a review
Niu, C., Irannezhad, E., Myers, C. R., & Dixit, V. (2026) · Transportation Letters · doi:10.1080/19427867.2026.2640414 · Cited by 9
“Quantum computing (QC) was first introduced in the early 1980s with the concept of quantum circuits (Benioff 1980; Feynman 2018).”
Liu, Y., Tao, Y.-H., Lan, J.-R., & Fei, S.-M. (2025) · Quantum Information and Computation · doi:10.2478/qic-2025-0031 · Cited by 2
“In 1980 Benioff and Manin [1] proposed the concept of quantum computing, and Feynman [2] introduced the theoretical framework of a quantum computer in 1982.”
Quantum algorithm for estimating Olivier-Ricci curvature
Nghiem, N. A., Nguyen, L., Do, K. T., Wei, T.-C., & Phan, T. V. (2026) · Physical Review Research · doi:10.1103/hj52-lksk · Cited by 4
STOCK PRICE PREDICTION USING QUANTUM NEURAL NETWORK
Mahajan, R. P. (2010) · Journal of Global Research in Computer Sciences · Cited by 1
Quantum Computation Relative to Oracles
Tamon, C., & Yamakami, T. (2001) · Springer eBooks · doi:10.1007/978-1-4471-0313-4_20 · Cited by 1
“Since its inception by Benioff [6] and Feynman [14], the idea of a quantum mechanical computer was investigated in various early works by Deutsch, Jozsa, and others [13, 7, 8, 30, 1], culminating in the seminal discovery by Shor [31] on an efficient quantum factoring algorithm.”
Lin, D. (2009) · Texas ScholarWorks (Texas Digital Library) · Cited by 1
Adaptive Quantum-inspired Evolution Strategy
Izadinia, H., & Ebadzadeh, M. M. (2012) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2012.6256433 · Cited by 1
“Quantum computers were proposed in the early 1980s [7], [8] and their description was formalized in the late 1980s [9], [10].”
BackgroundA one-way function from thermodynamics and applications to cryptography
Hungerbühler, N., & Struwe, M. (2003) · Elemente der Mathematik · doi:10.1007/s000170300008 · Cited by 1
“Benioff offered a classical Turing machine which used quantum mechanics in its workings, thus showing that theoretically a quantum computer was at least as powerful as a classical computer.”
MethodProperties of the two- and three-dimensional quantum dot qubit
Shihua, C. (2010) · Journal of Semiconductors · doi:10.1088/1674-4926/31/5/052001 · Cited by 1
Wei, X., & Fujimura, S. (2012) · IEEJ Transactions on Electrical and Electronic Engineering · doi:10.1002/tee.21712 · Cited by 1
Impurity and quaternions in nonrelativistic scattering from a quantum memory
Margetis, D., & Grillakis, M. G. (2008) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/41/6/065307 · Cited by 1
Programmable Two-Particle Bosonic-Fermionic Quantum Simulation System
Wang, Y., Wu, J., Tang, Y., Wang, H., & Wang, D. (2016) · Communications in computer and information science · doi:10.1007/978-981-10-2209-8_13 · Cited by 1
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.