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 101–200 of 1,003
Quantum computation in power systems: An overview of recent advances
Golestan, S., Habibi, M. R., Mousavi, S. Y. M., Guerrero, J. M., & Vásquez, J. C. (2022) · Energy Reports · doi:10.1016/j.egyr.2022.11.185 · Cited by 134
Quantum perceptron over a field and neural network architecture selection in a quantum computer
da Silva, A. J., Ludermir, T. B., & de Oliveira, W. R. (2016) · Neural Networks · doi:10.1016/j.neunet.2016.01.002 · Cited by 101
“The theoretical possibility of quantum computing initiated with Benioff [1] and Feynman [2] and the formalization of the first quantum computing model was proposed by Deutsch in 1985 [3].”
BackgroundSolving Gauss's law on digital quantum computers with loop-string-hadron digitization
Raychowdhury, I., & Stryker, J. R. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033039 · Cited by 159
“Quantum computation is expected to efficiently simulate quantum mechanical many-body problems [1–3], as quantum computers can handle the exponential growth of information in entangled quantum systems that overwhelms classical computers.”
BackgroundQuantum-inspired Multiobjective Evolutionary Algorithm for Multiobjective 0/1 Knapsack Problems
Kim, Y.-H., Kim, J.-H., & Han, K.-H. (2006) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2006.1688633 · Cited by 114
“Quantum mechanical computers were proposed in the early 1980s [7], [8].”
BackgroundZouache, D., Nouioua, F., & Moussaouı, A. (2015) · Soft Computing · doi:10.1007/s00500-015-1681-x · Cited by 103
“Quantum computing is a recent field in computer science which is interested in quantum computers using phenomena of quantum mechanics such as state superposition, entanglement and quantum gate (Benioff 1980; Akama 2014).”
BackgroundMethodInfluentialPreparations for quantum simulations of quantum chromodynamics in 1+1 dimensions. I. Axial gauge
Farrell, R. C., Chernyshev, I. A., Powell, S. J. M., Zemlevskiy, N. A., Illa, M., & Savage, M. J. (2023) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.107.054512 · Cited by 178
A quantum-inspired gravitational search algorithm for binary encoded optimization problems
Nezamabadi–pour, H. (2015) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2015.01.002 · Cited by 98
Efficient quantum arithmetic operation circuits for quantum image processing
Li, H.-S., Fan, P., Xia, H., Peng, H., & Long, G. (2020) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-020-1582-8 · Cited by 115
A Full Quantum Eigensolver for Quantum Chemistry Simulations
Wei, S., Li, H., & Long, G. (2020) · Research · doi:10.34133/2020/1486935 · Cited by 111
Quantum computing: An IBM perspective
Steffen, M., DiVincenzo, D. P., Chow, J. M., Theis, T. N., & Ketchen, M. B. (2011) · IBM Journal of Research and Development · doi:10.1147/jrd.2011.2165678 · Cited by 92
Post-Quantum and Code-Based Cryptography—Some Prospective Research Directions
Balamurugan, C., Singh, K., Ganesan, G., & Rajarajan, M. (2021) · Cryptography · doi:10.3390/cryptography5040038 · Cited by 110
“The work was initiated by several mathematicians and physicists such as Paul Benioff (1980) [12], Yuri Manin (1980) [13], Richard Feynman (1982) [14], and David Deutsch (1985) [15].”
BackgroundQuantum robots and environments
Benioff, P. (1998) · Physical Review A · doi:10.1103/physreva.58.893 · Cited by 88
Self-citationUncertainty principle and minimal energy dissipation in the computer
Landauer, R. W. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857731 · Cited by 100
Biology and medicine in the landscape of quantum advantages
Cordier, B. A., Sawaya, N. P. D., Guerreschi, G. G., & McWeeney, S. K. (2022) · Journal of The Royal Society Interface · doi:10.1098/rsif.2022.0541 · Cited by 87
“The notion that a quantum computer may be more powerful than a classical computer was first conceived some forty years ago in the context of simulating physical systems [1, 2, 3].”
BackgroundAn introduction to quantum information processing: applications and realizations
Spiller, T. P., Munro, W. J., Barrett, S. D., & Kok, P. (2005) · Contemporary Physics · doi:10.1080/00107510500293261 · Cited by 90
Quantum Algorithm for Hilbert's Tenth Problem
Kieu, T. D. (2003) · International Journal of Theoretical Physics · doi:10.1023/a:1025780028846 · Cited by 99
Entanglement: quantum or classical?
Paneru, D., Cohen, E., Fickler, R., Boyd, R. W., & Karimi, E. (2020) · Reports on Progress in Physics · doi:10.1088/1361-6633/ab85b9 · Cited by 80
Konar, D., Bhattacharyya, S., Sharma, K., Sharma, S., & Pradhan, S. R. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2016.12.051 · Cited by 81
Introduction to Quantum AlgorithmsPreprint
Shor, P. W. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0005003 · Cited by 105
“Benioff [5] had already showed how quantum mechanical processes could be used as the basis of a classical Turing machine.”
Classical computing, quantum computing, and Shor's factoring algorithmPreprint
Manin, Y. I. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9903008 · Cited by 101
“For more on this, see [Ben1] and [Ben2].”
NISQ Computers: A Path to Quantum Supremacy
AbuGhanem, M., & Eleuch, H. (2024) · IEEE Access · doi:10.1109/access.2024.3432330 · Cited by 116
The physics of information technology
(2001) · Choice Reviews Online · doi:10.5860/choice.38-5598 · Cited by 81
Nishi, H., Kosugi, T., & Matsushita, Y. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00409-y · Cited by 112
Quantum information processing: cryptography, computation, and teleportation
Spiller, T. P. (1996) · Proceedings of the IEEE · doi:10.1109/5.546399 · Cited by 78
Zhao, Y., Qu, R., Xing, Z., & Lu, W. (2020) · Advances in Water Resources · doi:10.1016/j.advwatres.2020.103540 · Cited by 76
Quantum logic and entanglement by neutral Rydberg atoms: methods and fidelity
Shi, X. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac18b8 · Cited by 98
Coins, Quantum Measurements, and Turing's Barrier
Calude, C. S., & Pavlov, B. S. (2002) · Quantum Information Processing · doi:10.1023/a:1019623616675 · Cited by 76
“The method was inspired by and is closer “in spirit” to Benioff and Feynman early works [5, 20].”
MethodOracles for Gauss's law on digital quantum computers
Stryker, J. R. (2019) · Physical Review A · doi:10.1103/physreva.99.042301 · Cited by 115
Research of Quantum Genetic Algorith and its application in blind source separation
Yang, J., Li, B., & Zhuang, Z. (2003) · Journal of Electronics (China) · doi:10.1007/s11767-003-0089-4 · Cited by 75
Fundamental limits upon the measurement of state vectors
Jones, K. R. W. (1994) · Physical Review A · doi:10.1103/physreva.50.3682 · Cited by 76
Quantum technologies in the telecommunications industry
Martin, V., Brito, J. P., Escribano, C., Menchetti, M., White, C., Lord, A., Wissel, F., Gunkel, M., Gavignet, P., Genay, N., et al. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00108-9 · Cited by 85
Nuclear magnetic resonance for quantum computing: Techniques and recent achievements
Xin, T., Wang, B.-X., Li, K., Kong, X., Wei, S.-J., Wang, T., Ruan, D., & Long, G. (2018) · Chinese Physics B · doi:10.1088/1674-1056/27/2/020308 · Cited by 82
Quantum Algorithm Design: Techniques and Applications
Shao, C., Yang, L., & Li, H. (2019) · Journal of Systems Science and Complexity · doi:10.1007/s11424-019-9008-0 · Cited by 75
Preparation of the SU(3) lattice Yang-Mills vacuum with variational quantum methods
Ciavarella, A. N., & Chernyshev, I. A. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.105.074504 · Cited by 131
“[28] P. 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 (1980).”
BackgroundQuantum multiverse optimization algorithm for optimization problems
Sayed, G. I., Darwish, A., & Hassanien, A. E. (2019) · Neural Computing and Applications · doi:10.1007/s00521-017-3228-9 · Cited by 72
“Quantum computers were proposed in the 1980s [2, 5].”
BackgroundFredkin, E., & Toffoli, T. (2002) · Springer eBooks · doi:10.1007/978-1-4471-0129-1_3 · Cited by 105
Automata theory based on quantum logic: some characterizations
Qiu, D. (2004) · Information and Computation · doi:10.1016/j.ic.2003.11.003 · Cited by 73
Quantum Hamiltonian Complexity
Gharibian, S., Huang, Y., Landau, Z. A., & Shin, S. W. (2015) · now publishers, Inc. eBooks · doi:10.1561/9781680830071 · Cited by 72
On setting the parameters of quantum-inspired evolutionary algorithm for practical application
Han, K.-H., & Kim, J.-H. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2003.1299572 · Cited by 79
“Quantum mechanical computers were proposed in the early 1980s [4], [5] and their description was formalized in the late 1980s [6].”
BackgroundQuantum-Inspired Genetic Algorithm for Resource-Constrained Project-Scheduling
Saad, H. M. H., Chakrabortty, R. K., Elsayed, S. M., & Ryan, M. J. (2021) · IEEE Access · doi:10.1109/access.2021.3062790 · Cited by 69
“The first construction of a quantum-mechanical model for quantum computing was proposed early in 1980 by Benioff [34], and Feynman [35], [36], who explained the possibility of simulating quantum principles for computation using quantum physics.”
Duality quantum computer and the efficient quantum simulations
Wei, S.-J., & Long, G. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1263-6 · Cited by 73
“Benioff constructed a quantum mechanical model of computers so as to reduce heat dissipation [48].”
BackgroundQuantum Walks for Computer Scientists
Venegas-Andraca, S. E. (2008) · Synthesis lectures on quantum computing · doi:10.2200/s00144ed1v01y200808qmc001 · Cited by 90
Causal Boxes: Quantum Information-Processing Systems Closed under Composition
Portmann, C., Matt, C., Maurer, U. M., Renner, R., & Tackmann, B. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2676805 · Cited by 93
“Many fundamental notions used to define quantum computation are derived by generalizing classical notions, e.g., quantum Turing machines [58–61], quantum circuits [60,62], or the machine model used in quantum composable security [22,23].”
BackgroundQuantum Computation and Information
Sernadas, A., Mateus, P., & Omar, Y. (2007) · Springer eBooks · doi:10.1007/978-1-4020-5690-1_3 · Cited by 66
“…problem, dissipation of heat, also led people to consider quantum systems to process information: since quantum dynamics is reversible in time by its very nature, Paul Benioff proposed in the early 1980's a quantum Turing machine [12] [13] as a way to do computation without dissipating any energy.”
BackgroundDuality quantum algorithm efficiently simulates open quantum systems
Wei, S.-J., Ruan, D., & Long, G. (2016) · Scientific Reports · doi:10.1038/srep30727 · Cited by 73
“Equation (1) can be rewritten as6 ∑ ε ρ ρ = ⊗ † e U e e U e ( ) { } (2) k k k 0 0”
Light for the quantum. Entangled photons and their applications: a very personal perspective
Zeilinger, A. (2017) · Physica Scripta · doi:10.1088/1402-4896/aa736d · Cited by 75
A Leap among Quantum Computing and Quantum Neural Networks: A Survey
Massoli, F. V., Vadicamo, L., Amato, G. M., & Falchi, F. (2022) · ACM Computing Surveys · doi:10.1145/3529756 · Cited by 94
“The quest for a quantum computer started with the ideas of Benoff [23] and Feynmann [73, 121], in the 1980s, pointing out that quantum computers should be more efficient in solving specific problems.”
BackgroundApplication of quantum approximate optimization algorithm to job shop scheduling problem
Kurowski, K., Pecyna, T., Slysz, M., Różycki, R., Waligóra, G., & Węglarz, J. (2023) · European Journal of Operational Research · doi:10.1016/j.ejor.2023.03.013 · Cited by 98
Nishimura, H., & Ozawa, M. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00111-6 · Cited by 81
“ar X iv :q ua nt -p h/ 99 06 09 5v 3 2 6 D Keywords: Quantum computation; Complexity theory; Quantum Turing machines; Uniform quantum circuit families; Universal quantum Turing machines”
BackgroundA Thermal Unit Commitment Approach Using an Improved Quantum Evolutionary Algorithm
Jeong, Y.-W., Park, J., Shin, J.-R., & Lee, K. Y. (2009) · Electric Power Components and Systems · doi:10.1080/15325000902762331 · Cited by 62
“Quantum mechanical computers have been studied since the early 1980s and are shown to be more powerful than digital computers for solving various specialized problems [18, 19].”
BackgroundArtificial intelligence for quantum computing
Alexeev, Y., Farag, M. H., Patti, T. L., Wolf, M. E., Ares, N., Aspuru‐Guzik, A., Benjamin, S. C., Cai, Z., Cao, S., Chamberland, C., et al. (2025) · Nature Communications · doi:10.1038/s41467-025-65836-3 · Cited by 139
Quantum Automata with Open Time Evolution
Hirvensalo, M. (2010) · International Journal of Natural Computing Research · doi:10.4018/jncr.2010010104 · Cited by 61
Neural Error Mitigation of Near-Term Quantum Simulations
Bennewitz, E. R., Hopfmueller, F., Kulchytskyy, B., Carrasquilla, J., & Ronagh, P. (2022) · Nature Machine Intelligence · doi:10.1038/s42256-022-00509-0 · Cited by 93
“Both components are wrapped with a skip-connection, layer normalization [3], and a ReLU activation function.”
BackgroundQRCI: A new quantum representation model of color digital images
Wang, L., Ran, Q., Ma, J., Yu, S., & Tan, L. (2019) · Optics Communications · doi:10.1016/j.optcom.2019.01.015 · Cited by 59
Kieu, T. D. (2002) · CERN Document Server (European Organization for Nuclear Research) · Cited by 59
Quantum Computer Systems: Research for Noisy Intermediate-Scale Quantum Computers
Ding, Y., & Chong, F. T. (2020) · Synthesis lectures on computer architecture · doi:10.2200/s01014ed1v01y202005cac051 · Cited by 74
Face Patterns Analysis and Recognition System Based on Quantum Neural Network QNN
ALRikabi, H. T. S., Aljazaery, I. A., Alrubaye, J. S., Alaidi, A. H. M., & airaji, R. M. A. (2022) · International Journal of Interactive Mobile Technologies (iJIM) · doi:10.3991/ijim.v16i08.30107 · Cited by 70
Illa, M., & Savage, M. J. (2022) · Physical Review A · doi:10.1103/physreva.106.052605 · Cited by 79
“In[8]:= pauliVec = {PauliMatrix[1],PauliMatrix[2],PauliMatrix[3]}; bfield = {Sin[2*0.”
Reactive power and voltage control based on general quantum genetic algorithms
Vlachogiannis, J. G., & Østergaard, J. (2008) · Expert Systems with Applications · doi:10.1016/j.eswa.2008.07.070 · Cited by 59
A theory of computation based on quantum logic (I)
Ying, M. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.04.001 · Cited by 62
QuantumFed: A Federated Learning Framework for Collaborative Quantum Training
Xia, Q., & Li, Q. (2021) · Globecom · doi:10.1109/globecom46510.2021.9685012 · Cited by 84
“The idea of building a quantum computing based Turing machine was first proposed in early 1980s by Paul Benioff [3].”
Advances and opportunities in materials science for scalable quantum computing
Lordi, V., & Nichol, J. M. (2021) · MRS Bulletin · doi:10.1557/s43577-021-00133-0 · Cited by 87
A Quantum-Inspired Immune Algorithm for Hybrid Flow Shop with Makespan Criterion
Niu, Q., Ma, S., & Zhou, T. (2020) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.3217/jucs-015-04-0765 · Cited by 56
Entanglement and electron correlation in quantum chemistry calculations
Huang, Z., Wang, H., & Kais, S. (2006) · Journal of Modern Optics · doi:10.1080/09500340600955674 · Cited by 60
Quantum computer on a class of one-dimensional Ising systems
Berman, G. P., Doolen, G. D., Holm, D. D., & Tsifrinovich, V. I. (1994) · Physics Letters A · doi:10.1016/0375-9601(94)90537-1 · Cited by 69
Quantum realization of the nearest-neighbor interpolation method for FRQI and NEQR
Sang, J., Wang, S., & Niu, X. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1135-5 · Cited by 55
“Along with the bright prospect of quantum computers [1,2], quantum image processing has inspired interest by researchers in recent years.”
BackgroundIntroduction to quantum algorithms
Shor, P. W. (2002) · Proceedings of symposia in applied mathematics · doi:10.1090/psapm/058/1922896 · Cited by 76
“Benioff [5] had already showed how quantum mechanical processes could be used as the basis of a classical Turing machine.”
Shaping the Future of the Application of Quantum Computing in Intelligent Transportation System
Wang, S., Pei, Z., Wang, C., & Wu, J. (2021) · Intelligent and Converged Networks · doi:10.23919/icn.2021.0019 · Cited by 61
Multimode higher-order antibunching and squeezing in trio coherent states
An, N. B. (2002) · Journal of Optics B Quantum and Semiclassical Optics · doi:10.1088/1464-4266/4/3/310 · Cited by 59
Hamiltonian quantum cellular automata in one dimension
Nagaj, D., & Wocjan, P. (2008) · Physical Review A · doi:10.1103/physreva.78.032311 · Cited by 56
Wen, J., Kong, X., Wei, S., Wang, B.-X., Xin, T., & Long, G. (2019) · Physical Review A · doi:10.1103/physreva.99.012320 · Cited by 59
A Quantum Algorithm for finding the MaximumPreprint
Ahuja, A., & Kapoor, S. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9911082 · Cited by 53
El‐Dabah, M. A., Hassan, M. H., Kamel, S. M., & Zawbaa, H. M. (2022) · IEEE Access · doi:10.1109/access.2022.3195892 · Cited by 54
“Quantum Algorithm (QA) was firstly proposed in [49].”
BackgroundQuantum Neural Network Classifiers: A Tutorial
Li, W., Lu, Z., & Deng, D.-L. (2022) · SciPost Physics Lecture Notes · doi:10.21468/scipostphyslectnotes.61 · Cited by 71
“The proposal of quantum computing dates back to 1980 when the quantum Turing machine was introduced by Paul Benioff [81].”
MethodThe controlled SWAP test for determining quantum entanglement
Foulds, S., Kendon, V. M., & Spiller, T. P. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abe458 · Cited by 73
“Quantum entanglement is an essential resource for obtaining a quantum advantage in communications [15; 33], metrology [10; 38], imaging [1; 30], and computation [8; 13; 32].”
BackgroundBarker, J. R. (1991) · NATO ASI series. Series B : Physics · doi:10.1007/978-1-4899-3689-9_21 · Cited by 62
A review on quantum information processing in cavities
Meher, N., & Sivakumar, S. (2022) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-022-03172-x · Cited by 60
Nuclear Forces for Precision Nuclear Physics: A Collection of Perspectives
Tews, I., Davoudi, Z., Ekström, A., Holt, J. D., Becker, K., Briceño, R., Dean, D. J., Detmold, W., Drischler, C., Duguet, T., et al. (2022) · Few-Body Systems · doi:10.1007/s00601-022-01749-x · Cited by 70
A hybrid quantum chaotic swarm evolutionary algorithm for DNA encoding
Xiao, J., Xu, J., Chen, Z., Zhang, K., & Pan, L. (2008) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2008.10.021 · Cited by 50
Automata theory based on quantum logic: Reversibilities and pushdown automata
Qiu, D. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2007.05.026 · Cited by 49
“In 1980, Benioff [7] first considered that computing devices in terms of the principles of quantum mechanics could be at least as powerful as classical computers.”
BackgroundQubit Allocation for Distributed Quantum Computing
Mao, Y., Liu, Y., & Yang, Y. (2023) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom53939.2023.10228915 · Cited by 67
Molecular docking via quantum approximate optimization algorithm
Ding, Q.-M., Huang, Y., & Yuan, X. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.034036 · Cited by 63
“Quantum computing, a concept first introduced in the 1980s by Feynman and other pioneers [1–3], has made significant strides, particularly with the developments of Shor’s algorithm [4] and others [5].”
BackgroundEvolution in Materio: Exploiting the Physics of Materials for ComputationPreprint
Harding, S. L., Miller, J. F., & Rietman, E. A. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cond-mat/0611462 · Cited by 50
“Benioff first suggested quantum mechanical computation as Turing machine automata on Hamiltonian lattices [34], [35].”
BackgroundQuantum Computing in Supply Chain Management State of the Art and Research Directions
Gachnang, P., Ehrenthal, J. C. F., Hanne, T., & Dornberger, R. (2022) · Asian Journal of Logistics Management · doi:10.14710/ajlm.2022.14325 · Cited by 49
Distributed Grover's algorithm
Qiu, D., Luo, L., & Xiao, L. (2024) · Theoretical Computer Science · doi:10.1016/j.tcs.2024.114461 · Cited by 83
“Quantum computers were first considered by Benioff [2], and then suggested by Feynman [12] in 1982.”
BackgroundSolid-state quantum computation—a new direction for nanotechnology
Berman, G. P., Doolen, G. D., & Tsifrinovich, V. I. (2000) · Superlattices and Microstructures · doi:10.1006/spmi.1999.0801 · Cited by 51
Quinton, F. A., Myhr, P. A. S., Barani, M., Crespo del Granado, P., & Zhang, H. (2025) · Scientific Reports · doi:10.1038/s41598-025-96220-2 · Cited by 46
“Although rapid progress coincides with modern times, the idea of using “simple” systems governed by Quantum Mechanics (QM) to perform computation was proposed already in the 1980s by both Richard Feynman [4] and Paul Benioff [5] independently.”
Perspectives of quantum computing for chemical engineering
Bernal, D. E., Ajagekar, A., Harwood, S. M., Stober, S. T., Trenev, D., & You, F. (2022) · AIChE Journal · doi:10.1002/aic.17651 · Cited by 58
The End of Moore’s Law: Opportunities for Natural Computing?
Peper, F. (2017) · New Generation Computing · doi:10.1007/s00354-017-0020-4 · Cited by 53
“Brain-inspired architectures and dynamical systems generally use analog values, whereas quantum computing [3] and noise-based computing [31] use superpositions of binary values.”
BackgroundZouache, D., & Abdelaziz, F. B. (2017) · Computers & Industrial Engineering · doi:10.1016/j.cie.2017.10.025 · Cited by 50
Izuogu, D. C., Yoshida, T., Zhang, H., Cosquer, G., Katoh, K., Ogata, S., Hasegawa, M. L., Nojiri, H., Damjanović, M., Wernsdorfer, W., et al. (2018) · Chemistry - A European Journal · doi:10.1002/chem.201800699 · Cited by 46
Lewenstein, M. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552331 · Cited by 46
Quantum Computing: Principles and Applications
Kanamori, Y., & Yoo, S.-M. (2020) · Journal of international technology and information management · doi:10.58729/1941-6679.1410 · Cited by 58
“Various quantum algorithms were developed since quantum computing was proposed in the 1980s (Benioff, 1980; Coles et al., 2018; Feynman, 1982; Montanaro, 2016).”
MethodQuantum computing and chemistry
Weidman, J. D., Sajjan, M., Mikolas, C. A., Stewart, Z. J., Pollanen, J., Kais, S., & Wilson, A. K. (2024) · Cell Reports Physical Science · doi:10.1016/j.xcrp.2024.102105 · Cited by 71
Experimental demonstration of a digital quantum simulation of a general PT -symmetric system
Wen, J., Zheng, C., Kong, X., Wei, S., Xin, T., & Long, G. (2019) · Physical Review A · doi:10.1103/physreva.99.062122 · Cited by 51
Pan, D., Li, K., Ruan, D., Ng, S. X., & Hanzo, L. (2020) · IEEE Access · doi:10.1109/access.2020.3006136 · Cited by 55
“However, classical cryptosystems are facing an imminent threat with the accelerating development of quantum computers [1], [2] and powerful quantum algorithms [3]–[7], which exhibit powerful computing capabilities [8], [9].”
BackgroundQuantum computing for market research
Sáez‐Ortuño, L., Huertas-García, R., Forgas‐Coll, S., Sánchez, J., & Puertas, E. (2024) · Journal of Innovation & Knowledge · doi:10.1016/j.jik.2024.100510 · Cited by 59
A review of procedures to evolve quantum algorithms
Gepp, A., & Stocks, P. (2009) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-009-9080-7 · Cited by 46
“The first quantum computation model was the quantum Turing machine (QTM) introduced by Benioff [6] and Deutsch [14], which can efficiently simulate every classical Turing machine (CTM) with a polynomial-bounded overhead [27].”
BackgroundMethod(2022) · Nature Reviews Physics · doi:10.1038/s42254-021-00410-6 · Cited by 42
Robin, C., & Savage, M. J. (2023) · Physical Review C · doi:10.1103/physrevc.108.024313 · Cited by 49
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.