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 701–800 of 1,003
Ballhysa, E. (2004) · Cited by 4
Proof rules for purely quantum programsPreprint
Feng, Y., Duan, R., Ji, Z., & Ying, M. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0507043 · Cited by 4
Decidability of the Equivalence of Multi-Letter Quantum Finite AutomataPreprint
Qiu, D., Zou, X., Li, L., & Mateus, P. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0812.1061 · Cited by 4
“Quantum computers—the physical devices complying with the rules of quantum mechanics were first considered by Benioff [7], and then suggested by Feynman [10].”
QUANTUM FIELD THEORY AND COMPUTATIONAL PARADIGMS
Krishnamurthy, E. V., & Krishnamurthy, V. (2001) · International Journal of Modern Physics C · doi:10.1142/s0129183101002437 · Cited by 4
One-way quantum finite automata together with classical statesPreprint
Qiu, D., Mateus, P., Zou, X., & Sernadas, A. (2009) · arXiv (Cornell University) · Cited by 4
Adlam, E. (2017) · Apollo (University of Cambridge) · doi:10.17863/cam.22081 · Cited by 6
Quantum Accelerated Estimation of Algorithmic Information.Preprint
Sarkar, A., Al-Ars, Z., & Bertels, K. (2020) · arXiv (Cornell University) · Cited by 4
(2008) · CRC Press eBooks · doi:10.1201/b15868-2 · Cited by 4
Reduction of Theoretical Uncertainty in Quantum Computing
Matsueda, H., & Cohen, D. W. (1999) · International Journal of Theoretical Physics · doi:10.1023/a:1026663408959 · Cited by 4
Joint Interoperability: Fog or Lens for Joint Vision 2010
Reddy, P. C. (1997) · Defense Technical Information Center (DTIC) · doi:10.21236/ada388057 · Cited by 4
Variance minimization for nuclear structure on a quantum computer
Hobday, I., Stevenson, P. D., & Benstead, J. (2025) · Physical Review C · doi:10.1103/44k6-w3dt · Cited by 7
A new quantum differential squirrel search algorithm for global optimization problem
Mai, X., Zhong, Y., Liu, L., & Liu, H.-B. (2025) · Cluster Computing · doi:10.1007/s10586-025-05571-y · Cited by 5
Alwan, N. A., Obaiys, S. J., Al-Saidi, N. M. G., Noor, N. F. B. M., & Karaca, Y. (2025) · Scientific Reports · doi:10.1038/s41598-025-24168-4 · Cited by 3
“QIP bridges quantum computing and image analysis, offering advantages like exponential storage gains and quantum features such as entanglement and parallelism 4,12–14 .”
Quantum-inspired genetic algorithm with chromosome clustering for 0-1 knapsack problems
Choi, B., Jung, J., Eun, J., & Choi, I. (2026) · Applied Soft Computing · doi:10.1016/j.asoc.2026.115231 · Cited by 3
A review of quantum machine learning methods for remote sensing tasks
Aburaed, N., Khan, F. S., & Alkhatib, M. Q. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00394-5 · Cited by 4
“At the same time, Benioff ( 1980 ) and Manin ( 1980 ) independently introduced the concept of quantum Turing machines, and Deutsch ( 1985 ) formalized the notion of a universal quantum computer.”
Stenger, J., Hellberg, C. S., & Gunlycke, D. (2024) · ACS Omega · doi:10.1021/acsomega.4c01642 · Cited by 5
Evaluation of quantum image processing in CUDA-based simulation
Hasegawa, A., Maede, Y., & Fukushima, N. (2024) · SPIE Future Sensing Technologies · doi:10.1117/12.3022770 · Cited by 4
“2,3 While classical computers could only take digital bits (0 or 1), quantum computers can use qubits (i.e., quantum superposition state), which have a coherent superposition of multiple states simultaneously until it is measured.”
BackgroundAn Operator's View on Opportunities and Challenges of Quantum Internet of Things
Z., L. A. G., Yin, M., Hopfmann, C., Sena, M. R., Geitz, M., Holschke, O., Bassoli, R., & Fitzek, F. H. P. (2023) · IEEE World Forum on Internet of Things (WF-IoT) · doi:10.1109/wf-iot58464.2023.10539574 · Cited by 3
“In 1980, Paul Benioff presented the theoretical model of a quantum computer in [1], and in 1982, Richard Feynman recognized the vast computing potential concealed within quantum systems and computers, proposing their first application in [2].”
BackgroundOperation of Single‐Spin Qubits: Recent Advances and Prospects
Zhang, Z., Ran, J., Gao, F., Jia, C., & Guo, X. (2025) · Advanced Physics Research · doi:10.1002/apxr.202400146 · Cited by 3
Guowei, 张. Z., Guanzhong, 黄. H., Fangxiang, 王. W., & Wei, 陈. C. (2025) · Laser & Optoelectronics Progress · doi:10.3788/lop250992 · Cited by 3
Zhang, Y., Zhao, J., Jia, Y., & Shen, X. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04776-9 · Cited by 7
Effect of disorder and strain on the operation of planar Ge hole spin qubits
Sarkar, A., Chowdhury, P., Hu, X., Saraiva, A., Dzurak, A. S., Hamilton, A. R., Rahman, R., & Culcer, D. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01130-w · Cited by 10
“Quantum computing 2 – 4 with semiconductor spin qubits 5 – 7 has burgeoned over the past two decades 8 – 10 , owing to their prospective scalability from the elementary few-qubit systems to large arrays 11 – 13 .”
Solving k–SAT problems with generalized quantum measurement
Zhang, Y., Lewalle, P., & Whaley, K. B. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01069-y · Cited by 10
Quantum-Inspired Evolution Strategy
Izadinia, H., & Ebadzadeh, M. M. (2009) · International Conference of Soft Computing and Pattern Recognition (SoCPaR) · doi:10.1109/socpar.2009.146 · Cited by 3
Improved Quantum Interference Crossover-Based Genetic Algorithm and its Application
Dai, H., & Li, C. (2008) · International Conference on Intelligent Networks and Intelligent Systems · doi:10.1109/icinis.2008.35 · Cited by 3
“It was proposed by Benioff [1] and Feynman [2] in the early 1980s.”
BackgroundEfficient simulation of open quantum system in duality quantum computing
Wei, S.-J., & Long, G. (2016) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.2245869 · Cited by 3
“Simulation of quantum systems is the important original motivation of Feynman came up with the idea of quantum computers.(1,2) The progress in quantum simulation is developing very rapidly.”
BackgroundKane, C., & McGuigan, M. (2018) · New York Scientific Data Summit (NYSDS) · doi:10.1109/nysds.2018.8538962 · Cited by 3
“The concept of a quantum computer was proposed by Paul Benioff in 1980 [1], and Richard Feynman in 1982 [2].”
BackgroundBuilding a quantum computer (invited)
Sanders, B. C. (2020) · doi:10.1145/3414622.3431913 · Cited by 3
“I present a brief history of quantum computing, which dates back to early concepts by Benioff [3, 4] and Feynman [12], to current commercial quantum computing.”
BackgroundMethodIngber, L. (2021) · Advances in human and social aspects of technology book series · doi:10.4018/978-1-7998-6772-2.ch006 · Cited by 3
A Tutorial on Quantum Approximate Optimization Algorithm for Maximum Independent Set Problem
Yang, M., Gao, F., Wu, G., Dai, W., & Shuang, F. (2021) · Chinese Control Conference (CCC) · doi:10.23919/ccc52363.2021.9550042 · Cited by 5
“The concept of quantum computer was firstly proposed in 1980 by P. Benioff[1].”
BackgroundPeper, F. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1800-9_128 · Cited by 3
Laflamme, R., & Knill, E. H. (2000) · Springer eBooks · doi:10.1007/978-94-010-0948-5_7 · Cited by 3
Quantum algorithms for simulation of quantum chemistry problems by quantum computers: an appraisal
Sharma, S. (2022) · Foundations of Chemistry · doi:10.1007/s10698-022-09428-9 · Cited by 4
“The proposal of a quantum mechanical model of the Turing machine by Paul Benioff in the 1980s was the starting point for Quantum computing (Benioff 1980).”
MethodJiang, D., Yu, D., Zheng, Z., Cao, X.-C., Lin, Q., & Liu, W. (2022) · Acta Physica Sinica · doi:10.7498/aps.71.20220596 · Cited by 3
Quantum hobbit routing: Annealer implementation of generalized Travelling Salesperson Problem
Delgado, I. P., Markaida, B. G., Moreno-Fernández-de-Leceta, A., & Uriarte, J. A. O. (2022) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci51031.2022.10022127 · Cited by 6
“Paralelly, along with the demonstration of the Turing completeness of ‘quantum states’ by Benioff [7] —which would now be called ‘qubits’ [8]— Manin [9] and Feynman [10] started to think of quantum devices as computational machines: if quantum systems are hard to simulate by classical computers,…”
BackgroundMu, L., & Wang, P. (2023) · Applied Soft Computing · doi:10.1016/j.asoc.2023.110560 · Cited by 3
岳, 天., 吴, 晨., 刘, 熠., 杜, 正., 赵, 娜., 焦, 毅., 徐, 喆., & 史, 文. (2023) · SCIENTIA SINICA Terrae · doi:10.1360/sste-2022-0319 · Cited by 3
Reducing circuit depth with qubitwise diagonalization
Murairi, E. M., & Cervia, M. J. (2023) · Physical Review A · doi:10.1103/physreva.108.062414 · Cited by 3
The controlled SWAP test for entanglement of mixed quantum states
Zhang, R., Qu, Y.-D., Shen, S., Li, M., & Wang, J. (2024) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/ad2f5a · Cited by 4
Citizen science games on the timeline of quantum games
Piispanen, L. J. (2024) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-024-05553-w · Cited by 4
The success and failure of quantum computing start-ups
Sanders, B. C. (2025) · Nature Electronics · doi:10.1038/s41928-025-01337-x · Cited by 3
Applying analog quantum computing to solve optimisation problems: case studies on Max-Cut and CVRP
Deleplanque, S., Yaagoubi, A. E., Gras, T., Descamps, F., Mourrier, J., & Lefebvre, I. (2025) · International Journal of Systems Science Operations & Logistics · doi:10.1080/23302674.2025.2463530 · Cited by 5
Multiplexed processing of quantum information across an ultrawide optical bandwidth
Eldan, A., Gillon, O., Lagemi, A., Fishman-Furman, E., & Pe’er, A. (2026) · Science Advances · doi:10.1126/sciadv.adw5085 · Cited by 3
“In the decades since the conception of quantum information in the 1980s, many practical applications were developed, ranging form secure communications [1–3] and quantum information transmission protocols [4], through quantum sensing schemes [5–8] to quantum computation [9–12].”
Combined prediction model of quantum genetic grey prediction model and support vector machine
Cao, J., Fang, Y., Liu, Q., & Liu, A. (2016) · International Conference on Computer Science and Network Technology (ICCSNT) · doi:10.1109/iccsnt.2016.8070157 · Cited by 3
“Quantum Genetic Algorithm (QGA) Quantum genetic algorithm, firstly proposed by Narayanan et al, has been a new research field since 1990s [7].”
MethodMachine learning assisted quantum adiabatic algorithm design
Lin, J. H., Ye, M., Zhu, J., & Li, X. (2021) · Acta Physica Sinica · doi:10.7498/aps.70.20210831 · Cited by 3
Three-Qubit Implementation of Quantum Fourier Transform for Shor’s Algorithm
Trivedi, D., Saharia, A., Choure, K. K., Tiwari, M., Maddila, R. K., & Singh, G. (2021) · Lecture notes in electrical engineering · doi:10.1007/978-981-16-2818-4_12 · Cited by 3
Quantum Computing and Its Impact
Turlington, M., Sattler, L. E., Pacella, D. J., Gamble, J., & Toy, M. (2021) · Springer eBooks · doi:10.1007/978-3-030-81961-3_16 · Cited by 4
Local approximation of multipartite quantum measurements
Cohen, S. M. (2022) · Physical Review A · doi:10.1103/physreva.105.022207 · Cited by 7
Cybersecurity and Integrated Business Models
Islam, M. T., & Karim, R. (2022) · Springer eBooks · doi:10.1007/978-3-030-97877-8_1 · Cited by 3
Wen, J., Zheng, C., Huang, Z., & Qian, L. (2023) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/acc052 · Cited by 6
Quaternionic quantum Turing machines
Dai, S. (2023) · Frontiers in Physics · doi:10.3389/fphy.2023.1162973 · Cited by 3
Prasad, V. K., Cheng, F., Fekl, U., & Jacobsen, H. (2024) · Physical Chemistry Chemical Physics · doi:10.1039/d3cp03523a · Cited by 4
(2018) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789813238411_0015 · Cited by 3
Bio-inspiring Techniques in Watermarking Medical Images: A Review
Soliman, M., Hassanien, A. E., & Onsi, H. M. (2014) · Intelligent systems reference library · doi:10.1007/978-3-662-43616-5_4 · Cited by 3
Calibration of the VGSSD Option Pricing Model using a Quantum-inspired Evolutionary Algorithm
Fan, K., O’Sullivan, C., Brabazon, A., O’Neill, M., & McGarraghy, S. (2008) · Studies in computational intelligence · doi:10.1007/978-3-540-78532-3_7 · Cited by 3
“if φ = 1/5 then σij = σij where σij is the width of the i quantum chromosome’s j gene, g is a constant in the range [0, 1] and φ is the proportion of individuals in the new population that have improved their fitness.”
BackgroundUnitary 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-citationWang, L., Wang, X., & Fei, M. (2009) · ACM/SIGEVO Summit on Genetic and Evolutionary Computation (GEC) · doi:10.1145/1543834.1543908 · Cited by 3
“Quantum computing firstly proposed by Paul Benioff in the early 1980s [ 4 ], is a popular research area that includes concepts like quantum mechanical computers and quantum algorithms [5].”
BackgroundRayner, M. R., & Newman, D. J. (1995) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/28/19/016 · Cited by 5
Modeling and prospects for a solid-state quantum computer
Ruda, H. E., & Qiao, B. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2003.818332 · Cited by 3
“Theoretical proposals for a quantum computer (QC) date back to the paper of Kikkawa and coworkers in 1980 [1].”
BackgroundDey, S., Bhattacharyya, S., & Maulik, U. (2016) · Elsevier eBooks · doi:10.1016/b978-0-12-804409-4.00006-1 · Cited by 3
Gammanpila, A. C., & Fernando, T. G. I. (2020) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-63089-8_5 · Cited by 3
Optimizing Hamiltonian control using quantum machine learning method
Yi, T., Wang, J., & Xu, F. (2021) · International Conference on Electronic Information Engineering and Computer Science (EIECS) · doi:10.1109/eiecs53707.2021.9587938 · Cited by 3
Fundamentals of Computer Science
Puster, E. (2022) · Springer eBooks · doi:10.1007/978-3-030-93765-2_2 · Cited by 3
Eisert, J., & Wolf, M. M. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-387-27705-6_8 · Cited by 7
Quantum Optics and Quantum Information Processing in Rare-Earth-Ion-Doped Crystals
Ohlsson, N. (2003) · Lund University Publications (Lund University) · Cited by 3
On Coverings of Products of Uninitialized Sequential Quantum Machines
Huang, F. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04031-9 · Cited by 3
“Benioff [1] and Feyman [2] firstly proposed the idea of quantum computers.”
BackgroundJones, W. R. (2021) · Water International · doi:10.1080/02508060.2021.2005332 · Cited by 3
“This will require what is now referred to as quantum computing, which was identified theoretically in the early 1980s (Benioff, 1980; Feynman, 1982).”
BackgroundDivincenzo, D. P. (2008) · Springer series in materials science · doi:10.1007/978-3-540-74559-4_12 · Cited by 3
Sinha, A. (2022) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0413 · Cited by 3
“For category D, in figure 6, we have marked the classic publications [112,2,113] by Benioff in 1980, Feynman in 1982 and Deutsch in 1985, respectively.”
BackgroundInfluentialHalting in quantum Turing computationPreprint
Fouché, W. L., Heidema, J., Jones, G., & Potgieter, P. H. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0705.3077 · Cited by 3
“5 Paul Benioff had related a similar idea somewhat earlier [5] but primarily in connection with presenting a possible physical basis for reversible computing.”
BackgroundQuantum search processes in the cyclic group state spacesPreprint
Miao, X. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0507236 · Cited by 5
Simulations of Quantum Turing Machines by Quantum Multi-Stack MachinesPreprint
Qiu, D. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0501176 · Cited by 3
Semantics of a purely quantum programming languagePreprint
Feng, Y., Duan, R., Ji, Z., & Ying, M. (2005) · arXiv (Cornell University) · Cited by 3
An XAS Study of the Cation Binding Sites in the Purple Membrane of Halobacterium Salinarum
Sepulcre, F., Proietti, M. G., Benfatto, M., Longa, S. D., Garca, J., & Padrs, E. (2005) · Physica Scripta · doi:10.1238/physica.topical.115a00855 · Cited by 3
Benioff, P. A. (1997) · Physical review. B, Condensed matter · doi:10.1103/physrevb.55.9482 · Cited by 4
Self-citationNonstochastic Particle Acceleration in Collisionless Shock Waves
Ohsawa, Y. (2004) · Physica Scripta · doi:10.1238/physica.topical.107a00032 · Cited by 4
Quantum Advantage with Shallow Circuits Under Arbitrary Corruption
Hasegawa, A., & Gall, F. L. (2021) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.48550/arxiv.2105.00603 · Cited by 5
“Quantum computing was introduced in the early 1980s as a quantum mechanical model of the Turing machine that has a potential to simulate things that a classical computer could not [10, 20].”
BackgroundQuantum Simulations of the Non-Unitary Time Evolution and Applications to Neutral-Kaon OscillationsPreprint
Chen, Y., Ma, Y., & Shun Zhou, C. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.04765 · Cited by 4
Peper, F. (2009) · Springer eBooks · doi:10.1007/978-0-387-30440-3_347 · Cited by 3
Gate-based Quantum Computing: An OverviewPreprint
da Silva, R. P. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4347584 · Cited by 6
Hybrid Quantum-Classical Computing - A Fusion of Classical And Quantum Computational SubstratesPreprint
Ramouthar, R., & Şeker, H. (2023) · AfricArXiv (OSF Preprints) · doi:10.31730/osf.io/rj7cv · Cited by 8
Motion Planning Algorithms for Safety and Quantum Computing Efficiency
Lathrop, P., & (NNSA), U. N. N. S. A. (2023) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/2229652 · Cited by 3
Solving Chromatic Number with Quantum Search and Quantum Counting
Lutze, D. (2021) · doi:10.15368/theses.2021.59 · Cited by 3
Chamorro, N. L. (2024) · Documento ocasional/Documento ocasional - Banco de España · doi:10.53479/36696 · Cited by 10
(2025) · Nature Electronics · doi:10.1038/s41928-025-01346-w · Cited by 3
A Review on Quantum Machine Learning and Quantum Cryptography
Solar, M. (2024) · Memoria Investigaciones en Ingeniería · doi:10.36561/ing.27.12 · Cited by 2
An optimized exact multi-target search algorithm
Zhong, S., Zhao, Y., Dai, G., & Wu, D. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04932-1 · Cited by 2
Scalability analysis for transmon-based quantum computers
Zhang, S. (2025) · Micro and Nano Engineering · doi:10.1016/j.mne.2025.100327 · Cited by 2
“Quantum computing was conceptualized in early 1980s [1,2] as a powerful alternative with unprecedented advantages over conventional supercomputers for computational tasks involving quantum phenomena at atomic and molecular levels.”
Elite quantum ant colony algorithm based on double chain encoding for static optimization problems
Fu, X., Zhao, H. Y., Li, H., & Sun, Y. (2025) · Applied Intelligence · doi:10.1007/s10489-025-06958-5 · Cited by 2
Local Optimization of Quantum Circuits
Arora, J., Xu, M., Westrick, S., Liu, P., Li, D., Ding, Y., & Acar, U. A. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00069 · Cited by 5
A Comprehensive Review on Classification of Quantum Image Representations
Alwan, N. A., Al-Saidi, N. M. G., Obaiys, S. J., Noor, N. F. B. M., & Ahmad, M. (2025) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-025-10369-7 · Cited by 2
Gupta, N., Punia, D., Gautam, K., Sikka, G., Sharma, A. K., & Farouk, A. (2026) · Computer Science Review · doi:10.1016/j.cosrev.2026.100942 · Cited by 4
Fundamentals of Quantum Machine Learning and Robustness
Pira, L., & Rebentrost, P. (2026) · Quantum science and technology · doi:10.1007/978-3-032-11153-1_1 · Cited by 4
Model, data, and knowledge-driven geophysical inverse problems and intelligent computing
Wang, Y. (2026) · Science China Earth Sciences · doi:10.1007/s11430-025-1868-y · Cited by 3
Collisional S-matrix for the vibrational dynamics of H+H2 by quantum computing
Wang, Y., & Krstić, P. (2022) · Journal of Physics Communications · doi:10.1088/2399-6528/aca1f5 · Cited by 3
Formalizing the Semantics of a Classical-Quantum Imperative Language in Coq
Shi, W., Cao, Q., & Deng, Y. (2023) · Journal of Circuits Systems and Computers · doi:10.1142/s0218126624501123 · Cited by 2
The geometry of quantum computing
Ercolessi, E., Fioresi, R., & WEBER, T. W. (2024) · International Journal of Geometric Methods in Modern Physics · doi:10.1142/s0219887824400115 · Cited by 5
Computability of optimizers for AI and data science
Lee, Y., Boche, H., & Kutyniok, G. (2024) · Handbook of numerical analysis · doi:10.1016/bs.hna.2024.05.005 · Cited by 4
U(1) fields from qubits: An approach via D-theory algebra
Berenstein, D. E., Kawai, H., & Brower, R. C. (2024) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.110.014506 · Cited by 8
Ochi, A. R., Mahmud, S. G., Ghosh, B. C., & Margala, M. (2024) · IEEE International Conference on Nanotechnology (IEEE-NANO) · doi:10.1109/nano61778.2024.10628970 · Cited by 2
“Quantum computing, building upon the foundational works of Feynman [1],[2] and Beinoff [3], introduced the concept of qubits, harnessing the unique features of quantum mechanics such as superposition and entanglement for unparalleled computational power.”
Method
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.