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 901–1,000 of 1,003
Non-unitary Quantum Associative Memory
Neto, F. M. D. P., da Silva, A. J., de Oliveira, W. R., & Ludermir, T. B. (2017) · Brazilian Conference on Intelligent Systems · doi:10.1109/bracis.2017.36 · Cited by 1
“Quantum computing started at least in 1980s with the works of Benioff [20] and Richard Feynman [21].”
Multi-criterion, evolutionary and quantum decision making in complex systems
Balicki, J., Drozda, G., & Masiejczyk, J. (2011) · Cited by 1
Conclusive qudit states transformation implemented by remote parters
Hong, L. U., & LiBing, C. H. E. N. (2015) · Zhongguo kexue. Wulixue Lixue Tianwenxue · doi:10.1360/sspma2015-00282 · Cited by 1
Design and realization of a quantum Controlled NOT gate using optical implementation
Biswas, K., & Sajeed, S. (2012) · Cited by 3
Matrix low-rank approximate quantum algorithm based on singular value decomposition
Wang, F., Yang, F., Ya, Z., Li, S., & Wang, H. (2021) · Acta Physica Sinica · doi:10.7498/aps.70.20210411 · Cited by 1
Solving Bernstein and Vazirani’s Problem with the 2-bit Permutation Function
Chen, C.-Y., Chang, C.-Y., & Hsueh, C.-C. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03345-0 · Cited by 1
“Since Benioff proposed the concept of quantum Turing machine [1, 2] in 1980, many researchers have paid attention to quantum algorithms.”
BackgroundPeper, F. (2018) · Springer eBooks · doi:10.1007/978-1-4939-6883-1_347 · Cited by 1
Du, K.-L., & Swamy, M. N. S. (2016) · Springer eBooks · doi:10.1007/978-3-319-41192-7_17 · Cited by 1
The Future’s Most Advanced Computing Tool: Quantum Computers
(2022) · Journal of Research in Science and Engineering · doi:10.53469/jrse.2022.04(08).03 · Cited by 1
Expressing Power of Elementary Quantum Recursion Schemes for Quantum Logarithmic-Time Computability
Yamakami, T. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-15298-6_6 · Cited by 5
Security Analysis of One-step QSDC Protocol with Hyperentanglement
Kim, K., Kim, B., & Heo, J. (2022) · IEEE VTS Asia Pacific Wireless Communications Symposium (APWCS) · doi:10.1109/apwcs55727.2022.9906498 · Cited by 1
“INTRODUCTION The advent of the concept of quantum computation in early 1980s has raised concerns among cryptologists, since the modern cryptography schemes use problems that requires enormous time complexity such as factorization and finding very large prime numbers[1][2].”
BackgroundNearly Quantum Computing by Simulation
Díaz, G. J., Barrios-Hernandez, C., Steffenel, L. A., & Couturier, J.-F. (2022) · Communications in computer and information science · doi:10.1007/978-3-031-23821-5_15 · Cited by 1
Temporal Response of Atoms Trapped in an Optical Dipole Trap: A Primer on Quantum Computing Speed
Baral, S., Easwaran, R. K., Jose, J., Ganesan, A., & Deshmukh, P. C. (2023) · Atoms · doi:10.3390/atoms11040072 · Cited by 1
Surface-electrode ion trap design for near-field microwave quantum gates
Tarlton, J. E., Thompson, R. C., & Lucas, D. M. (2023) · Applied Physics B · doi:10.1007/s00340-023-08030-x · Cited by 1
Numerical analysis of quantization‐based optimization
Seok, J., & Cho, C. S. (2023) · ETRI Journal · doi:10.4218/etrij.2023-0083 · Cited by 2
“The classic Markov chain Monte Carlo (MCMC) algorithm developed in the 1950s is an early algorithmic approach [4 – 8].”
MethodQuantum Computing Simulated Annealing Algorithm Applying in Portfolio Optimization Problem
Shan, B., & Shang, Z. (2023) · International Conference on Public Management, Digital Economy and Internet Technology (ICPDI) · doi:10.4108/eai.1-9-2023.2338767 · Cited by 1
Photon antibunching in sixth harmonic generation
Singh, R., & Giri, D. K. (2024) · Nanosystems Physics Chemistry Mathematics · doi:10.17586/2220-8054-2024-15-2-170-183 · Cited by 2
New quantum-inspired salp swarm algorithm: A comparative study on numerical computation
Pathak, S., Mani, A., Sharma, M., & Chatterjee, A. (2024) · Elsevier eBooks · doi:10.1016/b978-0-443-15533-8.00003-5 · Cited by 3
A Quantum Annealing Approach to Fluid Dynamics Problems Solving Navier-Stokes Equations
Rodríguez, J. D. D., Pérez, A. P., Fernández, E. I., & Valera, A. J. J. (2024) · International Conference on Smart and Sustainable Technologies (SpliTech) · doi:10.23919/splitech61897.2024.10612316 · Cited by 4
“In the quantum annealing paradigm, firstly introduced by Benioff [17], the problem relies on finding the ground state of an Ising model Hamiltonian, exploiting pure quantum phenomena such as superposition of states, quantum entanglement and quantum tunneling [18].”
MethodArtificial Intelligence and Quantum Computing
Wirtz, B. W. (2024) · Springer texts in business and economics · doi:10.1007/978-3-658-44675-8_13 · Cited by 1
A Systematic Review of Quantum BenchMarking
Malhotra, P., Kumar, A., & Garhwal, S. (2024) · International Journal of Theoretical Physics · doi:10.1007/s10773-024-05811-8 · Cited by 1
Driving Quantum Literacy: Multi-Stakeholder Collaborative Efforts in Philippine Education
General, J. J., Mariano, R. R., & Aborot, J. A. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.20458 · Cited by 1
Development of Nature-Inspired Algorithms for Intelligent Manufacturing Systems
Soni, J. M., & Bhattacharjee, K. (2025) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3693-7974-5.ch010 · Cited by 1
Suppressing gauge drift in quantum simulations with gauge transformations
Ball, C. (2025) · Physical Review A · doi:10.1103/physreva.111.042428 · Cited by 1
Application of quantum computing in choice-based network revenue management
Dalgaard, M., Boulanger, A., Papen, A., Hansen, R. T., Fiig, T., & Wesenberg, J. (2025) · Journal of Revenue and Pricing Management · doi:10.1057/s41272-025-00527-8 · Cited by 1
“The concept of a “universal quantum computer” was formalized in the early 1980s by Benioff (1980), Deutsch (1985), and others.”
Adiabatic Training for Variational Quantum Algorithms
Acosta, E., Cano, C., Botella, G., & Campos, R. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-90200-0_8 · Cited by 3
Distributed exact generalized Grover’s algorithm
Zhou, X., Xu, X., Zheng, S., & Luo, L. (2026) · Frontiers of Computer Science · doi:10.1007/s11704-025-50239-w · Cited by 6
“The first ideas about quantum computing were proposed by Benioff [1] and Feynman [2] in the 1980s.”
What quantum computers may tell us about quantum mechanics
Monroe, C. R. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814990.020 · Cited by 1
“However, Paul Benioff and Richard Feynman showed in the early 1980s that quantum-mechanical computing elements such as single atoms could, in principle, behave as adequate electronic components not hampered by dirty quantum effects (Benioff 1980, 1982; Feynman 1982).”
Quantum hybrid genetic algorithm based on simulated annealing and its application
Nie, A. (2011) · International Journal of the Physical Sciences · doi:10.5897/ijps11.983 · Cited by 1
Quantum-behaved Electromagnetism-like Mechanism Algorithm for Economic Load Dispatch of Power System
Zhisheng, Z., Gong, W., & Xiaoyan, D. (2015) · Journal of Electrical Engineering and Technology · doi:10.5370/jeet.2015.10.4.1415 · Cited by 1
“The concept of quantum computing was proposed in the early 1980s [14].”
BackgroundClassical and Quantum Computation
Yan, S. Y. (2015) · Springer eBooks · doi:10.1007/978-3-319-25823-2_2 · Cited by 1
Development of theoretical approaches for post-silicon information processing
Ivády, V. (2016) · Linköping studies in science and technology. Dissertations · doi:10.3384/diss.diva-131853 · Cited by 1
“The field of quantum computation was initiated by several researchers, such as Paul Benioff[11], Yuri Manin, Richard Feynman[12], and David Deutsch[13], who inspired scientists to develop quantum algorithms, such as Peter Shor’s factorization algorithm[8] and Lov Grover’s algorithm of quantum database search[14].”
MethodLambda calculi and logics for quantum computing
Zorzi, M. (2009) · Cited by 1
Schöning, U., & Pruim, R. J. (1998) · Springer eBooks · doi:10.1007/978-3-642-60322-8_27 · Cited by 1
Temporal Topic Correlation and Evolution
Prayote, A., & Songklang, K. (2018) · International Joint Conference on Computer Science and Software Engineering · doi:10.1109/jcsse.2018.8457380 · Cited by 1
Cohen, S. M. (2019) · Physical Review A · doi:10.1103/physreva.100.042324 · Cited by 2
“[6] P.”
BackgroundTheory of non-Markovian dynamics in resonance fluorescence spectrum
Kumar, A. (2018) · Optical and Quantum Electronics · doi:10.1007/s11082-018-1582-1 · Cited by 1
A NOVEL REVERSIBLE FAULT TOLERANT MICROPROCESSOR DESIGN IN AMS 0.35UM PROCESS
Cılasun, H., & Altun, M. (2017) · DergiPark (Istanbul University) · Cited by 1
Emerging Trends in Machine Learning
Joshi, A. V. (2019) · Springer eBooks · doi:10.1007/978-3-030-26622-6_13 · Cited by 1
A Quantum Feature Selection Algorithm for Multi-Classification Problem
Chen, J., Liu, W., Gao, P., & Wang, H. (2019) · IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData) · doi:10.1109/ithings/greencom/cpscom/smartdata.2019.00105 · Cited by 1
“Since Benioff [16] and Feynman [17] explored the theoretical possibilities of quantum computing, some excellent results have been proposed one after another.”
BackgroundDjordjević, I. B. (2012) · Elsevier eBooks · doi:10.1016/b978-0-12-385491-9.00005-8 · Cited by 3
Elementary quantum gates between long-distance qubits mediated by a resonator
Li, M.-C., & Chen, A. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02858-4 · Cited by 1
What is Quantum Computing and How it Works, Artificial Intelligence Driven by Quantum Computing
Zohuri, B. (2020) · Modern Approaches on Material Science · doi:10.32474/mams.2020.03.000157 · Cited by 1
“Computers that perform quantum computation are known as Quantum Computers[1-5].”
BackgroundNoisy Intermediate Scale Quantum Computers: on the Co-Simulation of Qubits and Control Electronics
Blokhina, E., Bizzarri, F., Giounanlis, P., Leipold, D. R., & Brambilla, A. (2020) · IEEE International Conference on Electronics, Circuits and Systems (ICECS) · doi:10.1109/icecs49266.2020.9294837 · Cited by 1
“Quantum Computers (QC) are computing systems based on quantum mechanical principles of superposition and entanglement [1].”
BackgroundSupervisory Control of Quantum Discrete Event Systems
Qiu, D. (2026) · SIAM Journal on Control and Optimization · doi:10.1137/26m1849326 · Cited by 1
Yamakami, T. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-87993-8_12 · Cited by 1
Information-Theoretic Limits of Quantum Learning via Data Compression
Angrisani, A., Coyle, B., & Kashefi, E. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00011 · Cited by 1
“The origins of quantum computation also find roots in the 1980 s, when Richard Feynman and others proposed harnessing quantum physics to create a novel model of computation [3]–[5].”
Decompositions of average probability uninitialized sequential quantum machines
Huang, F. (2022) · Soft Computing · doi:10.1007/s00500-022-07063-2 · Cited by 1
“Benioff (1980) and Feynman (1982) firstly proposed the idea of quantum computers.”
BackgroundTopics on Quantum Information Science
Curilef, S., & Plastino, A. R. (2021) · IntechOpen eBooks · doi:10.5772/intechopen.94639 · Cited by 1
Towards Efficient Reasoning of Quantum Programs
Yu, N. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22308-2_2 · Cited by 1
Lattice-valued General Orthomodular Automata
Abolpour, K., ZAHEDI, M. M., & Shamsizadeh, M. (2023) · International Journal of Theoretical Physics · doi:10.1007/s10773-022-05242-3 · Cited by 2
“In recent years, the high speed of quantum computation development has encouraged many researchers to establish a computation theory based on quantum logic [6, 10, 12, 15, 20].”
BackgroundThe quantum accelerated PointNet algorithm
Li, P.-J., & Li, X. (2023) · International Journal of Quantum Information · doi:10.1142/s0219749923500089 · Cited by 1
Quantum Weighted Fractional-Order Transform
Zhao, T., & Chi, Y. (2023) · Fractal and Fractional · doi:10.3390/fractalfract7030269 · Cited by 1
Quantum simulation of quantum mechanical system with spatial noncommutativity
Chowdhury, S. H. H., Chowdhury, T. A., Nasri, S., Nazim, O. I., & Saad, S. (2023) · International Journal of Quantum Information · doi:10.1142/s0219749923500284 · Cited by 1
Ukai, R., Yoshimura, C., & Mizuno, H. (2023) · International Symposium on Computing and Networking · doi:10.1109/candar60563.2023.00034 · Cited by 1
“Historically, it begins with a proposal of a microscopic quantum mechanical model of computer in 1980 [2], a proposal of simulating nature by quantum mechanical way in 1982 [3], and formularization of quantum Turing machine in 1985 [4].”
Artificial Intelligence and Quantum Computing
Wirtz, B. W. (2024) · Springer texts in business and economics · doi:10.1007/978-3-031-50289-7_8 · Cited by 1
Miao, X. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0607144 · Cited by 6
Quantum Information Theory and Applications to Quantum CryptographyPreprint
Papadakos, N. P. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0201057 · Cited by 1
“The last decades changed the landscape and both computers and information are mostly approached by their physical implementations [10, 11 , 12, 13].”
BackgroundDeterministic Event-based Simulation of Universal Quantum Computation
Michielsen, K. F. L., Raedt, H. A. D., & Raedt, K. D. (2007) · Springer proceedings in physics · doi:10.1007/978-3-540-32640-3_5 · Cited by 1
Quantum Information Science from the Perspective of a Device and Materials Engineer
Bandyopadhyay, S. (2003) · Elsevier eBooks · doi:10.1016/b978-012507060-7/50014-3 · Cited by 2
Reply to Comments on Neuroelectrodynamics: Where are the Real Conceptual Pitfalls?
Aur, D. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1210.1983 · Cited by 1
“[35] Benioff P, The Computer as a Physical System - A Microscopic Quantum-Mechanical Hamiltonian”
MethodGreen, H. S. (1998) · International Journal of Theoretical Physics · doi:10.1023/a:1026632923613 · Cited by 1
MAPPING, PROGRAMMABILITY AND SCALABILITY OF PROBLEMS FOR QUANTUM SPEED-UP
Krishnamurthy, E. V. (2003) · International Journal of Modern Physics C · doi:10.1142/s0129183103004772 · Cited by 1
Theory of measurement-based quantum computingPreprint
de Beaudrap, N., & Niel, J. R. (2008) · arXiv (Cornell University) · Cited by 1
Spingineering : quantum control in the presence of relaxation
Recht, B. (2002) · Cited by 2
On Ultimate Thermodynamic Limitations in Communication and Computation
Rothstein, J. (1988) · Springer eBooks · doi:10.1007/978-94-009-2794-0_3 · Cited by 1
Complexity analysis and semantics for quantum computation
Kashefi, E. (2003) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 4
St-Jules, M. (2016) · uO Research (University of Ottawa) · doi:10.20381/ruor-329 · Cited by 5
An Application of Quantum Finite Automata to Interactive Proof SystemsPreprint
Yamakami, T., & Nishimura, H. (2004) · Electronic colloquium on computational complexity · Cited by 1
Quantum Computation Relative to OraclesPreprint
Tamon, C., & Yamakami, T. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0010002 · 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.”
Harel, D., & Feldman, Y. (2008) · Unitext · doi:10.1007/978-88-470-0580-8_18 · Cited by 1
Quantum circuit design for computer-assisted Shor's algorithmPreprint
Hwang, C., Tseng, C.-Y., & Su, C.-F. (2022) · doi:10.36227/techrxiv.19152632.v1 · Cited by 2
Model-based Engineering and the Digital ThreadPreprint
Harrison, N., Whitfield, R. J., Odukoya, K. A., & Powell, A. (2022) · doi:10.24868/10659 · Cited by 1
Microscopic Theory of Topological Superfluidity in 2D Fermi Gases
Thompson, K. (2023) · Open Access Victoria University of Wellington | Te Herenga Waka (Figshare) · doi:10.26686/wgtn.22127102 · Cited by 2
Realization of Multi-Valued Logic Using Optical Quantum Computing
Choe, S. (2023) · PDXScholar (Portland State University) · doi:10.15760/etd.8192 · Cited by 1
A Menagerie of Symmetry Testing Quantum Algorithms
LaBorde, M. L. (2023) · Louisiana State University · doi:10.31390/gradschool_dissertations.6134 · Cited by 2
Chen, H. (2023) · OSF Preprints (OSF Preprints) · doi:10.31219/osf.io/nsuf5 · Cited by 1
Ramouthar, R., & Şeker, H. (2023) · doi:10.14293/pr2199.000251.v1 · Cited by 2
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0003 · Cited by 1
Towards Quantum Computational MechanicsPreprint
Liu, B., Ortíz, M., & Cirak, F. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4761763 · Cited by 4
Design of Light-Matter Interactions for Quantum TechnologiesPreprint
Arrazola, Í. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.11695 · Cited by 1
Efficient and secure software implementation of post-quantum cryptosystems
Filho, D. L. G. (2024) · doi:10.47749/t/unicamp.2024.1456290 · Cited by 1
Yahweh, B., Ekanem, A. M., George, N. J., Oduntan, E. O., Mohammed, S. S. N., Abdulhamid, A., Takim, B. N., Ante, J. E., Emmanuel, Y., & Essang, S. O. (2025) · Research Square · doi:10.21203/rs.3.rs-7262536/v1 · Cited by 1
Bertini, B. (2026) · Nature Physics · doi:10.1038/s41567-026-03173-y · Cited by 1
Cryptography for pragmatic distributed trust and the role of blockchain
Santos, Q. (2018) · doi:10.70675/5e74cea2z1935z4c7ez8e21zcfb975dbc797 · Cited by 1
Space-Time Discretization of Elasto-Acoustic Wave Equation in Polynomial Trefftz-DG Bases
Shishenina, E. (2018) · theses.fr (ABES) · doi:10.70675/e2d17298z2d31z440cz9716z6022dc848d80 · Cited by 1
Measurement-based quantum computation beyond qubits
Booth, R. I. (2022) · theses.fr (ABES) · doi:10.70675/97bf47ffz46f9z4ab4zb2c8z4a40d3815264 · Cited by 7
Study of Protocols Between Classical Clients and a Quantum Server
Colisson, L. (2022) · theses.fr (ABES) · doi:10.70675/81ee6bd6zb577z4b9bza57fzb37719ed77f2 · Cited by 1
The Quantum Computer - What Does It Means?
Kosiński, J. (2007) · Studia Informatica System and information technology
Quantum Plasmonics: From Quantum Statistics to Quantum Interferences
Martino, G. D. (2016) · Reviews in plasmonics · doi:10.1007/978-3-319-24606-2_12
The Differential Scheme and Quantum Computation
Irwin, R. J. (2011) · Syracuse University Libraries (Syracuse University)
Investigating Photonic Quantum Computation
Myers, C. R. (2007) · UWSpace (University of Waterloo) · Cited by 2
Generating pseudo-random quantum states: On the overparametrized methodPreprint
Maziero, J. (2015) · arXiv (Cornell University) · doi:10.13140/rg.2.1.1773.4564
Computational/Algorithmic Number Theory
Yan, S. Y. (2002) · Springer eBooks · doi:10.1007/978-3-662-04773-6_2
Topological Characterizations of Automata Theory Based on Quantum Logic
Guo, X. (2007) · Journal of Software · doi:10.1360/jos181282
Hacia la construcción de computadores para la inteligencia artificial
Ortiz, T. J. E. (2002) · Revista de la Facultad de Medicina
Quantum computing models as a tool box for controlling and understanding the nanoscopic world
Janzing, D. (2006) · Informatik - Forschung und Entwicklung · doi:10.1007/s00450-006-0013-x · Cited by 2
Einführung in Grundlagen und Protokolle der Quanteninformatik
Crell, B., & Uhlmann, A. (1998) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1
Quantum gate arrays as coherent sums over classical logic gate arrays
Nachtergaele, B., & Periwal, V. (1997) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/30/24/027
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.