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 601–700 of 1,003
Simulating Quantum Principles: Qiskit Versus Cirq
Pandey, R., Maurya, P., Singh, G. D., & Faiyaz, M. S. (2023) · Studies in computational intelligence · doi:10.1007/978-981-19-9530-9_18 · Cited by 7
Optimization of a probabilistic quantum search algorithm with a priori information
Huang, Y., & Pang, S. (2023) · Physical Review A · doi:10.1103/physreva.108.022417 · Cited by 6
Simulating Heisenberg interactions in the Ising model with strong drive fields
Ciavarella, A. N., Caspar, S., Singh, H., Savage, M. J., & Lougovski, P. (2023) · Physical Review A · doi:10.1103/physreva.108.042216 · Cited by 8
“In contrast, quantum simulations are expected to be able to address some of these quantities with polynomially scaling computational costs [72, 73], and quantum advantages in scientific applications are being sought.”
BackgroundClassical and quantum-inspired electromagnetism-like mechanism for solving 0/1 knapsack problems
Chou, Y., Chang, C.-C., Chiu, C.-H., Lin, F.-J., Yang, Y.-J., & Peng, Z.-Y. (2010) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2010.5642288 · Cited by 6
Image Segmentation Algorithm Based on Quantum Immune Programming
Bi, X., & Jin, G. (2007) · IEEE International Conference on Integration Technology · doi:10.1109/icitechnology.2007.4290506 · Cited by 6
Hamiltonian quantum computer in one dimension
Wei, T.-C., & Liang, J. C. (2015) · Physical Review A · doi:10.1103/physreva.92.062334 · Cited by 8
The evolution of PBIL algorithm when used to solve the nuclear reload optimization problem
da Silva, M. H., Legey, A. P., & Mól, A. C. D. A. (2017) · Annals of Nuclear Energy · doi:10.1016/j.anucene.2017.11.043 · Cited by 6
Proof of efficient, parallelized, universal adiabatic quantum computation
Mizel, A. (2019) · Physical Review A · doi:10.1103/physreva.99.022311 · Cited by 6
Assisted quantum simulation of open quantum systems
Liang, J., Lv, Q.-Q., Wang, Z., & Fei, S.-M. (2023) · iScience · doi:10.1016/j.isci.2023.106306 · Cited by 8
Modular Cluster Circuits for the Variational Quantum Eigensolver
Ghasempouri, S. E., Dueck, G. W., & Baerdemacker, S. D. (2023) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.3c03015 · Cited by 12
Turing Incomputable Computation
Fiske, M. S. (2018) · EPiC series in computing · doi:10.29007/x5g2 · Cited by 6
“The methods explained here pertain to (a).”
BackgroundQuantum 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
Application of entropies to the study of the decoherence of magnetopolaron in 0-D nanosystem
Tiotsop, M., Fotué, A. J., Fotsin, H. B., & Fai, L. C. (2018) · Optical and Quantum Electronics · doi:10.1007/s11082-018-1630-x · Cited by 6
“Since the introduction of this last field by Benioff (1980), Feynman (1982) and Deutsch (1985), it has received a lot of attention and is still a hot topic in nanoscience.”
BackgroundHayes, B. (1995) · American Scientist · Cited by 9
Consciousness: Computing the uncomputable
Triffet, T., & Green, H. S. (1996) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(96)00099-4 · 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 9
Models of Quantum Computers and Decoherence ProblemPreprint
Volovich, I. V. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9902055 · Cited by 8
“Various mathematical and physical aspects of quantum computations have been discussed in many works, see for example [1]-[9].”
BackgroundLloyd, S. (1993) · Vistas in Astronomy · doi:10.1016/0083-6656(93)90051-k · Cited by 6
“…out in a non-dissipative fashion, a number of Hamiltonian quantum-mechanical systems have been proposed whose time-evolutions over discrete inki vals are equivalent to those of spec:fic univcrsa) computers (Bennett 1973,1982; Benioff 1980, 1982, 1986; Feynman 1W2,1W5,1986; Deutsch 1985, 1989).”
BackgroundMethodSupercomputer-Simulationen von Transmon-Quantencomputern
Willsch, D. (2020) · RWTH Publications (RWTH Aachen) · doi:10.18154/rwth-2020-08027 · Cited by 14
A Survey on Quantum Machine Learning in Speech Acoustics
Kucharski, M. (2025) · IEEE International Symposium on Computational Intelligence and Informatics (CINTI) · doi:10.1109/cinti67731.2025.11311733 · Cited by 8
“The idea was introduced in 1980 by P. Benioff [15] and the word as a short version of ”quantum bit” in 1995 by B. Schumacher”
Quantum Assisted Architectures for Wireless Systems, the Case of Quantum 6G
Mohammed, A. A., Bounceur, A., & Hammoudeh, M. A. A. (2023) · International Conference on Future Networks and Distributed Systems (ICFNDS) · doi:10.1145/3644713.3644806 · Cited by 6
“The exploration of quantum computing began in the 1980s when researchers examined the quantum mechanical framework of Turing machines [15].”
BackgroundOn the theory of quantum and towards practical computation: A review
Kudelić, R. (2024) · Journal of Computational Science · doi:10.1016/j.jocs.2024.102454 · Cited by 7
Maiti, S., Banerjee, D., Chakraborty, B., & Huffman, E. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013283 · Cited by 11
“In this ecosystem, the technological realization of quantum computation, which was theoretically inspired by [9, 10], has ushered in a new array of opportunities for the development of computational paradigms.”
Zhang, A., Bao, C., Zhu, Z., & Ji, W. (2025) · Computational Materials Science · doi:10.1016/j.commatsci.2025.113950 · Cited by 6
Tightly-integrated quantum–classical computing using the QHDL hardware description language
Netzer, G., Hegde, P. R., Peng, I. B., & Markidis, S. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.107977 · Cited by 5
Quantum learning Boolean linear functions w.r.t. product distributions
Caro, M. C. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02661-1 · Cited by 12
“Around the same time, Benioff [7] and Feynman presented the idea of quantum computers [12] to the public and thus gave the starting signal for important innovations at the intersection of computer science, information theory and quantum theory.”
BackgroundQuantum computing for data-centric engineering and science
Herbert, S. (2022) · Data-Centric Engineering · doi:10.1017/dce.2022.36 · Cited by 6
“The conception of quantum computing is usually attributed to Richard Feynman, who in 1981 speculated that simulating the behaviour of a quantum mechanical system would require a computer that was itself somehow quantum mechanical in nature [1, 2]; Manin [3] and Benioff [4] also espoused similar ideas at around the sam…”
BackgroundA Survey of Universal Quantum von Neumann Architecture
Liu, Y., Wang, K., Liu, Y., & Wang, D. (2023) · Entropy · doi:10.3390/e25081187 · Cited by 8
“Landauer showed that erasing bits will cost energy, while with Toffoli gates, a classical computation can be made reversible [71].”
BackgroundQuantum-Assisted Machine Learning by Means of Adiabatic Quantum Computing
Duarte, L. T., & Deville, Y. (2024) · IEEE Mediterranean and Middle-East Geoscience and Remote Sensing Symposium (M2GARSS) · doi:10.1109/m2garss57310.2024.10537323 · Cited by 5
“The quantum computing paradigm is a relative new field of research as it emerged in the 1980s with seminal works such as [1] and [2].”
BackgroundImproving the full quantum eigensolver with exponentiated operators
Wang, B., Wen, J., Wu, J., Xie, H., Yang, F., Ruan, D., Wei, S., & Long, G. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.245117 · Cited by 6
Quantum public-key crypto via EPR pairs
Fu, X.-Q., Li, H.-W., Shi, J., Li, T., & Bao, W. (2024) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-024-2510-x · Cited by 5
Lesson learnt from the rise and fall of quantum radar research
Galati, G., Pavan, G., & Daum, F. E. (2025) · Academia quantum. · doi:10.20935/acadquant7586 · Cited by 8
Granular Computing Model Based on Quantum Computing Theory
Hu, J., & Guan, C. (2014) · International Conference on Computational Intelligence and Security (CIS) · doi:10.1109/cis.2014.55 · Cited by 5
“In the early 1980s, Benioff and Feynman firstly put forward the concept of quantum computing [6], quantum computing is a brand-new multidisciplinary crossing research field, including quantum physics, mathematics, cognitive science, computer science, information science and complexity science, etc.”
BackgroundThe physics of quantum computation
Falci, G., & Paladino, E. (2014) · International Journal of Quantum Information · doi:10.1142/s0219749914300034 · 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
Fundamentals of Quantum Computation and Quantum Information
Oliveira, I. S., Bonagamba, T. J., Sarthour, R. S., Freitas, J. C. C., & DeAzevedo, E. R. (2007) · Elsevier eBooks · doi:10.1016/b978-044452782-0/50005-1 · Cited by 8
Quantum Radar: A Brief Analytical Study
Al-Moahmmed, H. A. (2020) · International Computer Engineering Conference · doi:10.1109/icenco49778.2020.9357379 · Cited by 5
“In other hand, the principle of quantum information idea was first introduced by Paul Benioff in 1980[3].”
BackgroundBlokhina, E., Sokolov, A., Giounanlis, P., Wu, X., Bashir, I., Leipold, D. R., Staszewski, R. B., Brambilla, A., & Bizzarri, F. (2021) · IEEE Open Journal of Circuits and Systems · doi:10.1109/ojcas.2021.3105005 · Cited by 5
6G Networks Orientation by Quantum Mechanics
Henrique, P. S. R., & Prasad, R. (2022) · Journal of ICT Standardization · doi:10.13052/jicts2245-800x.1013 · Cited by 6
“This idea was published in his published paper entitled “ The Computer as a Physical System: A Microscopic Quantum Mechanical Hamiltonian Model of Computers as Rep-resented by Turing Machines ” [17].”
MethodQuantum Cellular Automata Controlled Self-Organizing Networks
Gyöngyösi, L., & Imre, S. (2011) · InTech eBooks · doi:10.5772/15750 · Cited by 6
“…Automata - Innovative Modelling for Science and Engineering 116 can be regarded as a natural extension of the original classical CA model, since the working mechanism of the CA is defined as the combination of parallel processes (Benioff, 1980), (Neumann, 1966), (Miller et al., 2006).”
BackgroundCombarro, E. F., Ranilla, J., & Rúa, I. F. (2019) · Computational and Mathematical Methods · doi:10.1002/cmm4.1009 · Cited by 5
QDLC - THE QUANTUM DEVELOPMENT LIFE CYCLE
Dey, N., Ghosh, M., Chakrabarti, A., & Saha, R. (2026) · doi:10.34218/ijqc_04_01_002 · Cited by 5
Biological computation running on quantum computation
Matsuno, K. (2021) · Biosystems · doi:10.1016/j.biosystems.2021.104467 · Cited by 5
Wiesner, K. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1800-9_146 · Cited by 6
Cahay, M. M., & Bandyopadhyay, S. (1993) · IEEE Potentials · doi:10.1109/45.207169 · Cited by 6
A Modified Quantum-Inspired Particle Swarm Optimization Algorithm
Wang, L., Zhang, M., Niu, Q., & Yao, J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23896-3_51 · Cited by 5
“In the early 1980s, Benioff firstly proposed the concept of quantum computing [1], which has attracted wide attention and soon become the hot topic of research due to its unique computational performance.”
BackgroundHybrid quantum inspired neural model for commodity price prediction
Mahajan, R. P. (2011) · International Conference on Advanced Communication Technology · Cited by 5
Analysis and Simulation of Grover’s Search Algorithm
Zhuang, J., Zhao, J., Xu, F., Hu, H., & Qiao, P. (2014) · International Journal of Machine Learning and Computing · doi:10.7763/ijmlc.2014.v4.380 · Cited by 7
Universality and programmability of quantum computers
Fouché, W. L., Heidema, J., Jones, G., & Potgieter, P. H. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.05.007 · Cited by 5
“1 Paul Benioff had related a similar idea somewhat earlier [2] but primarily in connection with presenting a possible physical basis for reversible computing.”
BackgroundWiesner, K. (2018) · Springer eBooks · doi:10.1007/978-1-4939-8700-9_426 · Cited by 5
Survey of computational assumptions used in cryptography broken or not by Shor's algorithm
Zhu, H. P. (2001) · eScholarship@McGill (McGill) · doi:10.82308/49952 · Cited by 16
Solving the quantum search problem in polynomial time on an NMR quantum computerPreprint
Miao, X. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0206102 · Cited by 7
“The quantum mechanical unitary dynamical description for the Turing machines was first given by Benioff [ 39 ] in 1980.”
MethodUniversal construction for the unsorted quantum search algorithmsPreprint
Miao, X. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0101126 · Cited by 10
“It obeys both the quantum mechanical laws and the mathematical principles [ 1-5 ].”
MethodDual computational basis qubit in semiconductor heterostructures
Gilbert, M. J., Akis, R., & Ferry, D. K. (2003) · Applied Physics Letters · doi:10.1063/1.1599633 · Cited by 5
Sampling and the complexity of nature
Hangleiter, D. (2020) · arXiv (Cornell University) · doi:10.17169/refubium-28790 · Cited by 10
Exploring Information for Quantum Machine Learning Models
Telahun, M. (2020) · ThinkIR: The University of Louisville's Institutional Repository (University of Louisville) · doi:10.18297/etd/3433 · Cited by 6
The 'Prime Factors' of Quantum Cryptography RegulationPreprint
Rand, L., & Rand, T. (2021) · SSRN Electronic Journal · doi:10.2139/ssrn.3904342 · Cited by 5
Approximation, Proof Systems, and Correlations in a Quantum WorldPreprint
Gharibian, S. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.2632 · Cited by 6
“In 1982, for example, physicist Richard Feynman proposed [96] the notion of building a quantum computer in order to simulate physical quantum systems faster then apparently possible with a classical computer (see also Benioff [43, 44, 45]).”
BackgroundQuantum Information Processing
Lloyd, S. (2009) · Springer eBooks · doi:10.1007/978-0-387-30440-3_437 · Cited by 5
Quantum Algorithms, Paraconsistent Computation and Deutsch's Problem.
Agudelo, J. C., & Carnielli, W. A. (2005) · Indian International Conference on Artificial Intelligence · Cited by 6
Higher-Order Antibunching of Light in Seven-Photon Interaction Process
Sahu, N., Kumar, S., & Giri, D. K. (2022) · Journal of Russian Laser Research · doi:10.1007/s10946-022-10051-4 · Cited by 5
Wang, A., Zhang, J., & Zou, S. (2024) · AIP Advances · doi:10.1063/5.0207981 · Cited by 4
Faster Algorithmic Quantum and Classical Simulations by Corrected Product Formulas
Bagherimehrab, M., Calderón, L. M., Berry, D. W., Schleich, P., Vakili, M. G., Aldossary, A., Campos-Gonzalez-Angulo, J. A., Gorgulla, C., & Aspuru‐Guzik, A. (2026) · PRX Quantum · doi:10.1103/phk5-slkl · Cited by 13
Barletta, V. S., Caivano, D., Pal, A., Scalera, M., & Martin, M. A. S. (2025) · Journal of Software Evolution and Process · doi:10.1002/smr.70005 · Cited by 7
“Quantum mechanics has been the centerpiece of research in theoretical physics since the early 1900s, and the first ideas about QC emerged in the early 1980s [17–19].”
Hu, C.-K., Xie, G., Poulsen, K., Zhou, Y., Chu, J., Liu, C. L., Zhou, R., Yuan, H., Shen, Y., Liu, S., et al. (2025) · Nature Communications · doi:10.1038/s41467-025-57812-8 · Cited by 8
“Also, we consider the case of the nearest-neighbor interacting case encoded in the final Hamiltonian Ground State, NN Excited State, NN Ground State, slow-dacay Excited State, slow-dacay 0 1 2 3 N 0 1 2 3 N”
Open and Closed Loop Approaches for Energy Efficient Quantum Optimal Control
Fauquenot, S., Sarkar, A., & Feld, S. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202400690 · Cited by 12
Quantum Computing for Quantum Chemistry
Schleich, P., Calderón, L. M., Sun, C., Bagherimehrab, M., Aldossary, A., Kottmann, J. S., & Aspuru‐Guzik, A. (2025) · ACS in focus · doi:10.1021/acsinfocus.7e9012 · Cited by 10
A review of quantum machine learning algorithms, applications, and emerging advantages
Gokhale, S. S., Dhote, R. R., & Delhibabu, R. (2026) · Discover Computing · doi:10.1007/s10791-026-10085-1 · Cited by 11
Biomolecular Quantum Computation
Bollinger, T. B. (2020) · Terry s Archive Online · doi:10.48034/20201007 · Cited by 4
“Along with Paul Benioff’s much more detailed 1980 proposal of Hamiltonian-based quantum mechanical computers, [5] as well as Feynman’s 1982 universal quantum emulator paper, [3] Manin is often quoted as one of the early inspirations for quantum computing, due almost entirely to this short…”
A Graph-Based Approach for Modelling Quantum Circuits
Alonso, D., Sánchez, P., & Álvarez, B. (2023) · Applied Sciences · doi:10.3390/app132111794 · Cited by 4
An exploratory study on the usage of quantum programming languages
Ferreira, F., & Campos, J. (2024) · Science of Computer Programming · doi:10.1016/j.scico.2024.103217 · Cited by 9
Quantum computational complexity and symmetry
Rethinasamy, S., LaBorde, M. L., & Wilde, M. M. (2024) · Canadian Journal of Physics · doi:10.1139/cjp-2023-0260 · Cited by 10
Laule, M. S. C., Olazabal, J., & Hanco, H. N. (2024) · Interfases · doi:10.26439/interfases2024.n020.7383 · Cited by 5
Quantum computing for molecular vibrational energies: A comprehensive study
Somasundaram, R., Jayaharish, R., Ramanan, R., & Chowdhury, C. (2025) · Materials Today Quantum · doi:10.1016/j.mtquan.2025.100031 · Cited by 7
Li, Z., Grabowska, D. M., & Savage, M. J. (2025) · Quantum · doi:10.22331/q-2025-09-29-1865 · Cited by 52
“In particular where the vertical line still marks the origin and the horizontal lines denote sequency operators 7 are created by taking the tensor product of ˆ O [2]0 with ˆ I and ˆ Z , respectively.”
Spectral quantum algorithm for passive scalar transport in shear flows
Pfeffer, P., Brearley, P., Laizet, S., & Schumacher, J. (2025) · Scientific Reports · doi:10.1038/s41598-025-27219-y · Cited by 8
Zhang, Z., Chen, G., Diao, Z., & Hemmer, P. (2009) · Advances in mechanics and mathematics · doi:10.1007/978-0-387-75714-8_14 · Cited by 5
“Benioff [4] first coined the term of quantum Turing machine (QTM).”
BackgroundA NEW QUANTUM PARTICLE SWARM OPTIMIZATION ALGORITHM WITH LOCAL ATTRACTING
Shao, D. X., Hu, S., & Fei, Y. (2016) · Neural Network World · doi:10.14311/nnw.2016.26.028 · Cited by 4
“Ever since Benioff [1] presented his quantum Turing machine (QTM) in 1980, the field of quantum computing has begun to be explored.”
BackgroundQuantum Computing Based Inference of GRNs
Khan, A., Saha, G. K., & Pal, R. K. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56154-7_21 · Cited by 4
A Quantum based Evolutionary Algorithm for Stock Index and Bitcoin Price Forecasting
Amjad, U., Ahmed, T., Tariq, H., & Hussain, A. (2018) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2018.090917 · Cited by 4
“Concept of Quantum mechanical computers was introduced in early 1980s [11] and the explanation of quantum mechanical computers was enacted in late years of 1980s [12].”
BackgroundImplementing a Quantum Coin Scheme
Murray, H., Horgan, J., Santos, J. F., Malone, D., & Siljak, H. (2020) · Irish Signals and Systems Conference · doi:10.1109/issc49989.2020.9180218 · Cited by 6
“Benioff [2] showed that a computer could operate under the laws of quantum mechanics by providing a Schrödinger equation description of Turing machines.”
MethodBasics of quantum communication
Alshehri, O., Li, Z.-H., & Al-Amri, M. (2021) · Elsevier eBooks · doi:10.1016/b978-0-12-821510-4.00007-8 · Cited by 5
Algoritmos quânticos com IBMQ Experience: Algoritmo de Deutsch-Jozsa
de Oliveira, A. N., de Oliveira, E. V. B., Santos, A. C., & Villas-Bôas, C. J. (2021) · Revista Brasileira de Ensino de Física · doi:10.1590/1806-9126-rbef-2021-0333 · Cited by 6
“Paralelamente, em 1936, a ciência da computação dava seus passos iniciais com os trabalhos de Alan Turing, mostrando a existência de uma máquina universal que realiza operações tendo por base uma lógica de algo-ritmos.”
BackgroundInfluentialCollision Forgery Attack on the AES-OTR Algorithm under Quantum Computing
Chang, L., Wei, Y., Wang, X., & Pan, X. (2022) · Symmetry · doi:10.3390/sym14071434 · Cited by 6
Work in Progress: Response Time Analysis of Real-Time Quantum Computing Systems
Cheng, A. M. K. (2023) · IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS) · doi:10.1109/rtas58335.2023.00033 · Cited by 4
“Quantum computing [6] is a research and development priority in the scientific community and beyond, critical in maintaining security and scientific leadership.”
Classical half-adder using trapped-ion quantum bits: Toward energy-efficient computation
Pratapsi, S. S., Huber, P. H., Barthel, P., Bose, S., Wunderlich, C., & Omar, Y. (2023) · Applied Physics Letters · doi:10.1063/5.0176719 · Cited by 11
Nondigital Implementation of the Arithmetic of Real Numbers
Litvinov, G. L., Маслов, В. П., & Shpiz, G. B. (2001) · Mathematical Notes · doi:10.1023/a:1010269817483 · Cited by 7
“The idea of quantum computing was first put forward by P. Benioff [ 3 , 4], Yu. I. Manin [5],”
MethodQoS Multicast Routing Based on a Quantum Chaotic Dragonfly Algorithm
Mahseur, M., Boukra, A., & Meraihi, Y. (2018) · Lecture notes in networks and systems · doi:10.1007/978-3-030-05481-6_4 · Cited by 4
Automation of quantum Braitenberg vehicles using finite automata: Moore machines
Mishra, N., Chandra, R. S., Behera, B. K., & Panigrahi, P. K. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2512-2 · Cited by 6
Collaborative quantum computation with redundant graph state
Tian, Y., Feng, T., & Zhou, X.-Q. (2019) · Acta Physica Sinica · doi:10.7498/aps.68.20190142 · Cited by 4
Gheorghe-Pop, I.-D., Tcholtchev, N., Ritter, T., & Hauswirth, M. (2021) · Lecture notes in networks and systems · doi:10.1007/978-3-030-80119-9_9 · Cited by 5
Quantum Computing for Machine Learning
Niraula, D., Jamaluddin, J., Pakela, J. M., & Naqa, I. E. (2022) · Springer eBooks · doi:10.1007/978-3-030-83047-2_5 · Cited by 4
LEGAL, POLITICAL AND ORGANIZATIONAL ASPECTS OF CYBERSECURITY IN THE EUROPEAN UNION
Grabowska, M. (2022) · On-line Journal Modelling the New Europe · doi:10.24193/ojmne.2022.38.05 · Cited by 4
Quantum coherent manipulation of magnetic molecules
Wang, Y., Liu, Z., Zhou, S. L., Gao, S. W., & Jiang, S. (2023) · Chinese Science Bulletin (Chinese Version) · doi:10.1360/tb-2022-1114 · Cited by 4
Implementing quantum Fourier transform using three qubits
Yachi, M., Hab‐arrih, R., & Jellal, A. (2023) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/acc8a2 · Cited by 4
EKSPLORASI KAPASITAS PENGKODEAN AMPLITUDO UNTUK MODEL QUANTUM MACHINE LEARNING
Adawiyah, R., & Munifah, M. (2023) · Informatika Jurnal Teknik Informatika dan Multimedia · doi:10.51903/informatika.v3i1.232 · Cited by 4
Modeling and Analysis of Margolus Quantum Cellular Automata Using Net-Theoretical Methods
Ojala, L., Penttinen, O.-M., & Parviainen, E. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27793-4_19 · Cited by 4
“The idea of a quantum mechanical computer was first published by Benioff in [1].”
BackgroundThe Landauer resistance and band spectra for the counting quantum turing machine
Benioff, P. A. (1998) · Physica D Nonlinear Phenomena · doi:10.1016/s0167-2789(98)00041-4 · Cited by 5
Self-citationClassical simulation of Grovers quantum algorithm
Hernández, J. E. C., Sierra, Y., & Cubillos, N. L. (2019) · Revista Brasileira de Ensino de Física · doi:10.1590/1806-9126-rbef-2019-0115 · Cited by 4
“It is well known that since the mid-nineteenth century with the emergence of classical computing under the architecture of the Church-Turing and Von Neumann machines [1], it was possible to build a computer capable of performing basic operations such as addition and multiplication in a few seconds.”
MethodIntroduction to Quantum Computation Reliability
Thornton, M. A. (2020) · IEEE International Test Conference (ITC) · doi:10.1109/itc44778.2020.9325277 · Cited by 4
“Acknowledgement considering the origin of quantum computers must also be given to Paul Benioff in his consideration of the quantum mechanical model of Turing machines in his 1980 paper [2].”
Background
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.