The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
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
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Particle Swarm Optimization Algorithm and Its Applications: A Systematic Review
Gad, A. G. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-021-09694-4 · Cited by 1,869
“40 years ago, quantum computer [20] was invented, and in the late 1980s, the quantum computer formal definition was given.”
BackgroundFredkin, E., & Toffoli, T. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857727 · Cited by 1,896
EXPERT SYSTEMS WITH APPLICATIONS
(2005) · Expert Systems with Applications · doi:10.1016/j.eswa.2004.10.010 · Cited by 1,656
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
Han, K.-H., & Kim, J.-H. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.804320 · Cited by 1,585
“Quantum mechanical computers were proposed in the early 1980s [7] and the description of quantum mechanical computers was formalized in the late 1980s [8].”
BackgroundQuantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
“Perturbative Gadgets 63 References 65 I. INTRODUCTION Quantum computation (QC) originated with Benioff’s proposals for quantum Turing machines (Benioff, 1980, 1982) and Feynman’s ideas for circumventing the difficulty of simulating quantum mechanics by classical computers (Feynman, 1982).”
BackgroundSteane, A. (1998) · Reports on Progress in Physics · doi:10.1088/0034-4885/61/2/002 · Cited by 1,391
Quantum computation and Shor's factoring algorithm
Ekert, A., & Jozsa, R. (1996) · Reviews of Modern Physics · doi:10.1103/revmodphys.68.733 · Cited by 1,354
Fredkin, E., & Toffoli, T. (2001) · Cited by 1,302
Ultimate physical limits to computation
Lloyd, S. (2000) · Nature · doi:10.1038/35023282 · Cited by 1,120
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Universal Computation by Quantum Walk
Childs, A. M. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.180501 · Cited by 1,002
“Such a construction could potentially be used to design a quantum computer that does not require dynamic control [24, 30, 31, 32, 33, 34, 35, 36, 37].”
BackgroundQuantum walks: a comprehensive review
Venegas-Andraca, S. E. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0432-5 · Cited by 934
“g [66,69,68,67,155,156,154,130,131,162,315].”
Reversible logic and quantum computers
Peres, A. (1985) · Physical Review A · doi:10.1103/physreva.32.3266 · Cited by 892
Landauer, R. (1991) · Physics Today · doi:10.1063/1.881299 · Cited by 804
Almost Any Quantum Logic Gate is Universal
Lloyd, S. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.346 · Cited by 690
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649
Quantum information processing with atoms and photons
Monroe, C. (2002) · Nature · doi:10.1038/416238a · Cited by 627
A Modular Functor Which is Universal¶for Quantum Computation
Freedman, M. H., Larsen, M., & Wang, Z. (2002) · Communications in Mathematical Physics · doi:10.1007/s002200200645 · Cited by 573
From quantum cellular automata to quantum lattice gases
Meyer, D. A. (1996) · Journal of Statistical Physics · doi:10.1007/bf02199356 · Cited by 556
“Introduction The realization that incentives to develop smaller and faster computers will eventually drive the devices from which they are constructed into the quantum regime motivated research into quantum mechanical limitations on deterministic computation as early as the 1970s [1].”
BackgroundCoelho, L. D. S. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2009.06.044 · Cited by 544
“Quantum mechanical computers were proposed in the early 1980s (Benioff, 1980) and the description of quantum mechanical computers was formalized in the late 1980s (Deutsch, 1985).”
BackgroundInformation and computation: Classical and quantum aspects
Galindo, A., & Martín-Delgado, M. A. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.347 · Cited by 552
Quantum walks: a comprehensive reviewPreprint
Venegas-Andraca, S. E. (2012) · Cited by 532
The physical nature of information
Landauer, R. (1996) · Physics Letters A · doi:10.1016/0375-9601(96)00453-7 · Cited by 517
From Quantum Cellular Automata To Quantum Lattice Gases
Meyer, D., Qca, F., David, Q., & Meyer, A. (1996) · CERN Document Server (European Organization for Nuclear Research) · Cited by 496
Han, K.-H., & Kim, J.-H. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.823467 · Cited by 482
“Quantum mechanical computers were proposed in the early 1980s [5], [6] and their description was formalized in the late 1980s [7], [8].”
BackgroundMilburn, G. J. (1989) · Physical Review Letters · doi:10.1103/physrevlett.62.2124 · Cited by 440
Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning
Coecke, B., & Kissinger, A. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316219317 · Cited by 413
Quantum mechanical Hamiltonian models of Turing machines
Benioff, P. (1982) · Journal of Statistical Physics · doi:10.1007/bf01342185 · Cited by 402
Self-citationQuantum annealing for industry applications: introduction and review
Yarkoni, S., Raponi, E., Bäck, T., & Schmitt, S. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac8c54 · Cited by 341
“It was first introduced in the early 1980s by physicist Paul Benioff [13, 14] and independently by Richard Feynman [56].”
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
Quantum computation and quantum information
Nagy, M., & Akl, S. G. (2006) · International Journal of Parallel, Emergent and Distributed Systems · doi:10.1080/17445760500355678 · Cited by 287
“The first models for a quantum computer (Benioff’s quantum upgrade of a classical reversible Turing machine [13], Feynman’s quantum mechanical computer [81] and Deutsch’s Universal QTM [61]) were abstract, theoretical tools designed to fathom the possibilities and limitations of quantum information processing, without…”
When Entanglement Meets Classical Communications: Quantum Teleportation for the Quantum Internet
Cacciapuoti, A. S., Caleffi, M., Van Meter, R., & Hanzo, L. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2020.2978071 · Cited by 292
“Quantum algorithms manipulate the amplitude and phase of either the total [31] or the partial [32] quantum wave function of the system to build interference patterns, affecting the probability of measuring particular values to execute the algorithms mentioned above.”
Quantum Mechanical Models of Turing Machines That Dissipate No Energy
Benioff, P. (1982) · Physical Review Letters · doi:10.1103/physrevlett.48.1581 · Cited by 295
Self-citationImplementation of the Quantum Fourier Transform
Weinstein, Y. S., Pravia, M. A., Fortunato, E. M., Lloyd, S., & Cory, D. G. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.1889 · Cited by 287
Spin-based quantum computers made by chemistry: hows and whys
Stamp, P. C. E., & Gaita-Ariño, A. (2009) · J. Mater. Chem. · doi:10.1039/b811778k · Cited by 277
A Survey of Important Issues in Quantum Computing and Communications
Yang, Z., Zolanvari, M., & Jain, R. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3254481 · Cited by 251
“Even though there are quantum mechanical models describing a Quantum Turing Machine (QTM) [9], [45], [46] (i.e., an abstract reference to model quantum effects), a quantum circuit based on quantum logic gates is a more common model [47].”
MethodSiraichi, M. Y., Santos, V. F. D., Collange, C., & Pereira, F. M. Q. (2018) · Proceedings of the 2018 International Symposium on Code Generation and Optimization · doi:10.1145/3168822 · Cited by 254
“6 Related Work Quantum computing [4], and the notion of universal quantum computers [10] date back to the eighties.”
The many facets of natural computing
Kari, L., & Rozenberg, G. (2008) · Communications of the ACM · doi:10.1145/1400181.1400200 · Cited by 237
“[13] P.”
BackgroundA framework for fast quantum mechanical algorithms
Grover, L. K. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276712 · Cited by 240
Ullah, U., & Garcia-Zapirain, B. (2024) · IEEE Access · doi:10.1109/access.2024.3353461 · Cited by 188
“The concept of QC was introduced in the early 1980s by Benioff and Feynman, who stated that quantum-based computers outperformed their classical equivalents when it came to solving particular problems [30].”
BackgroundA novel quantum representation of color digital images
Sang, J., Wang, S., & Li, Q. (2017) · Quantum Information Processing · doi:10.1007/s11128-016-1463-0 · Cited by 197
Ciavarella, A., Klco, N., & Savage, M. J. (2021) · Physical Review D · doi:10.1103/physrevd.103.094501 · Cited by 193
A Lambda Calculus for Quantum Computation
van Tonder, A. (2004) · SIAM Journal on Computing · doi:10.1137/s0097539703432165 · Cited by 197
“Currently there exist two main approaches to the theory of quantum computation: The quantum Turing machine, introduced by Benioff and Deutsch [1, 2], and the quantum circuit model, introduced by Deutsch [3].”
BackgroundMethodA quantum convolutional neural network on NISQ devices
Wei, S., Chen, Y., Zhou, Z., & Long, G. (2022) · AAPPS Bulletin · doi:10.1007/s43673-021-00030-3 · Cited by 192
“Quantum information processing (QIP) [1, 2], which exploits quantum-mechanical phenomena such as quantum superpositions and quantum entanglement, allows one to overcome the limitations of classical computation and reaches higher computational speed for certain problems [3–5].”
BackgroundA functional quantum programming language
Altenkirch, T., & Grattage, J. (2004) · Nottingham ePrints (University of Nottingham) · Cited by 196
The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet
Pan, D., Long, G.-L., Yin, L., Sheng, Y.-B., Ruan, D., Ng, S. X., Lu, J., & Hanzo, L. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3367535 · Cited by 180
“However, at the time of writing, the security of asymmetric cryptography is facing increasing threats from quantum computers [5]–[8], which are capable of factoring large primes.”
QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation
Li, A., Stein, S., Krishnamoorthy, S., & Ang, J. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3550488 · Cited by 183
“nnnnnnn Quantum computing (QC) [9, 86] has been envisioned as one of the most promising computing paradigms beyond Moore’s Law for tackling difficult computing challenges that are classically intractable arising from various domains like chemistry [46, 62], machine learning [13, 99], cryptography [47, 102], linear alg…”
BackgroundQuantum Optimization and Quantum Learning: A Survey
Li, Y., Tian, M., Liu, G., Peng, C., & Jiao, L. (2020) · IEEE Access · doi:10.1109/access.2020.2970105 · Cited by 177
“In the early 1980s, Benioff and Feynman put forward the idea of quantum computing, pointing out that computers using quantum mechanics were more effective than classical counterparts when dealing with specific problems [1].”
BackgroundA lambda calculus for quantum computation with classical control
SELINGER, P., & VALIRON, B. (2006) · Mathematical Structures in Computer Science · doi:10.1017/s0960129506005238 · Cited by 177
“Examples of such models include the quantum Turing machine (Benioff 1980; Deutsch 1985), where the entire machine state, including the tape, the finite control and the position of the head, is assumed to be a quantum state.”
BackgroundNISQ computing: where are we and where do we go?
Lau, J. W. Z., Lim, K. H., Shrotriya, H., & Kwek, L. C. (2022) · AAPPS Bulletin · doi:10.1007/s43673-022-00058-z · Cited by 173
Quantum programming languages: survey and bibliography
GAY, S. J. (2006) · Mathematical Structures in Computer Science · doi:10.1017/s0960129506005378 · Cited by 180
Standard model physics and the digital quantum revolution: thoughts about the interface
Klco, N., Roggero, A., & Savage, M. J. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac58a4 · Cited by 166
A novel quantum swarm evolutionary algorithm and its applications
Wang, Y., Feng, X.-Y., Huang, Y.-X., Pu, D.-B., Zhou, W.-G., Liang, Y.-C., & Zhou, C.-G. (2007) · Neurocomputing · doi:10.1016/j.neucom.2006.10.001 · Cited by 170
“0925-2312/$ - se doi:10.1016/j.ne Correspond E-mail addr cgzhou@jlu.edu In this paper, a novel quantum swarm evolutionary algorithm (QSE) is presented based on the quantum-inspired evolutionary algorithm (QEA).”
MethodInfluentialRietsche, R., Dremel, C., Bosch, S., Steinacker, L., Meckel, M., & Leimeister, J. M. (2022) · Electronic Markets · doi:10.1007/s12525-022-00570-y · Cited by 228
“In 1980, Paul Benioff envisioned the concept of a quantum touring machine, i.e., the theoretical concept of a quantum computer (Benioff, 1980).”
Cooling in strongly correlated optical lattices: prospects and challenges
McKay, D. C., & DeMarco, B. (2011) · Reports on Progress in Physics · doi:10.1088/0034-4885/74/5/054401 · Cited by 161
“mechanical models of computers as Turing machines [1], Richard Feynman delivered a talk during a Physics of”
MethodQuantum Sensing for Energy Applications: Review and Perspective
Crawford, S. E., Shugayev, R., Paudel, H. P., Lu, P., Syamlal, M., Ohodnicki, P. R., Chorpening, B., Gentry, R. W., & Duan, Y. (2021) · Advanced Quantum Technologies · doi:10.1002/qute.202100049 · Cited by 187
Quantum many-body theory for electron spin decoherence in nanoscale nuclear spin baths
Yang, W., Ma, W.-L., & Liu, R.-B. (2016) · Reports on Progress in Physics · doi:10.1088/0034-4885/80/1/016001 · Cited by 182
Quantum machine learning for chemistry and physics
Sajjan, M., Li, J., Selvarajan, R., Sureshbabu, S. H., Kale, S. S., Gupta, R., Singh, V., & Kais, S. (2022) · Chemical Society Reviews · doi:10.1039/d2cs00203e · Cited by 211
Quantum Computers as Universal Quantum Simulators: State‐of‐the‐Art and Perspectives
Tacchino, F., Chiesa, A., Carretta, S., & Gerace, D. (2019) · Advanced Quantum Technologies · doi:10.1002/qute.201900052 · Cited by 200
Computational advantage of quantum random sampling
Hangleiter, D., & Eisert, J. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.035001 · Cited by 145
Qubit-excitation-based adaptive variational quantum eigensolver
(2021) · doi:10.1038/s42005-021-00730-0 · Cited by 145
Asymptotically Optimal Quantum Circuits for d -Level Systems
Bullock, S. S., O’Leary, D. P., & Brennen, G. K. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.230502 · Cited by 172
“The dominant theoretical model of quantum computation is the quantum circuit [1] acting on quantum bits, or qubits [2].”
BackgroundIterative qubit-excitation based variational quantum eigensolver
Yordanov, Y., Armaos, V., Barnes, C., & Arvidsson-Shukur, D. (2021) · doi:10.21203/rs.3.rs-404173/v1 · Cited by 145
Quantum Hamiltonian Complexity
Gharibian, S., Huang, Y., Landau, Z., & Shin, S. W. (2015) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000066 · Cited by 144
“ρ ∈ D(C2n)! This was essentially the reason why Richard Feynman originally proposed [66, 67] the concept of quantum computing (see also Benioff [29, 30, 31]) — he believed quantum computers might enable an efficient study of quantum systems (which is otherwise generally intractable on a classical computer).”
BackgroundHybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
Callison, A., & Chancellor, N. (2022) · Physical Review A · doi:10.1103/physreva.106.010101 · Cited by 205
InAs/GaAs single-electron quantum dot qubit
Li, S., Xia, J., Liu, J., Yang, F., Niu, Z., Feng, S., & Zheng, H. (2001) · Journal of Applied Physics · doi:10.1063/1.1416855 · Cited by 146
Evading Quantum Mechanics: Engineering a Classical Subsystem within a Quantum Environment
Tsang, M., & Caves, C. M. (2012) · Physical Review X · doi:10.1103/physrevx.2.031016 · Cited by 163
Quantum-Inspired Evolutionary Algorithm for Real and Reactive Power Dispatch
Vlachogiannis, J. G., & Lee, K. Y. (2008) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2008.2004743 · Cited by 142
“Quantum computing was introduced in the early 1980s by Feynmann [21], [22] and Beinoff [23].”
MethodQuantum search without entanglement
Lloyd, S. (1999) · Physical Review A · doi:10.1103/physreva.61.010301 · Cited by 155
Efficient phase-factor evaluation in quantum signal processing
Dong, Y., Meng, X., Whaley, K. B., & Lin, L. (2021) · Physical Review A · doi:10.1103/physreva.103.042419 · Cited by 246
“[2] P.”
BackgroundQuantum-Inspired Immune Clonal Algorithm for Global Optimization
Jiao, L., Li, Y., Gong, M., & Zhang, X. (2008) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2008.927271 · Cited by 145
“Quantum mechanical computers were proposed in the early 1980s [10], and the description of quantum mechanical computers was formalized in the late 1980s [11].”
BackgroundQuantum simulation of fundamental particles and forces
Bauer, C., Davoudi, Z., Klco, N., & Savage, M. J. (2023) · Nature Reviews Physics · doi:10.1038/s42254-023-00599-8 · Cited by 267
Fusion rules and vortices in px+ipy superconductors
Stone, M., & Chung, S. B. (2006) · Physical Review B · doi:10.1103/physrevb.73.014505 · Cited by 138
Quantum computation, quantum theory and AI
Ying, M. (2009) · Artificial Intelligence · doi:10.1016/j.artint.2009.11.009 · Cited by 158
“In 1980, Benioff [11] constructed a quantum mechanical model of a Turing machine.”
MethodA fast quantum mechanical algorithm for database searchPreprint
Grover, L. K. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9605043 · Cited by 132
Quantum Computing and Simulations for Energy Applications: Review and Perspective
Paudel, H. P., Syamlal, M., Crawford, S. E., Lee, Y., Shugayev, R., Lu, P., Ohodnicki, P. R., Mollot, D., & Duan, Y. (2022) · ACS Engineering Au · doi:10.1021/acsengineeringau.1c00033 · Cited by 189
Noisy intermediate-scale quantum computers
Cheng, B., Deng, X., Gu, X. Q., He, Y., Hu, G., Huang, P., Li, J., Lin, B., Lu, D., Lu, Y., et al. (2023) · Frontiers of Physics · doi:10.1007/s11467-022-1249-z · Cited by 182
Quantum Computing 40 Years Later
Preskill, J. P. (2023) · CRC Press eBooks · doi:10.1201/9781003358817-7 · Cited by 188
Ultimate Computing: Biomolecular Consciousness and NanoTechnology
Hameroff, S. R. (1987) · CERN Document Server (European Organization for Nuclear Research) · Cited by 189
A survey on GANs for computer vision: Recent research, analysis and taxonomy
Iglesias, G., Talavera, E., & Díaz-Álvarez, A. (2023) · Computer Science Review · doi:10.1016/j.cosrev.2023.100553 · Cited by 171
“Since it was proposed in 1980 [14] it has always been restricted to a few laboratories around the world.”
BackgroundQuantum Walks for Computer Scientists
Venegas-Andraca, S. E. (2008) · Synthesis lectures on quantum computing · doi:10.1007/978-3-031-02511-2 · Cited by 133
Turbulence theories and statistical closure approaches
Zhou, Y. (2021) · Physics Reports · doi:10.1016/j.physrep.2021.07.001 · Cited by 139
Recent Advances for Quantum Neural Networks in Generative Learning
Tian, J., Sun, X., Du, Y., Zhao, S., Liu, Q., Zhang, K., Yi, W., Huang, W., Wang, C., Wu, X., et al. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2023.3272029 · Cited by 189
“Earlier work in the 1980s [79] brought forward”
BackgroundSupercomputing with spin-polarized single electrons in a quantum coupled architecture
Bandyopadhyay, S., Das, B., & Miller, A. E. (1994) · Nanotechnology · doi:10.1088/0957-4484/5/2/007 · Cited by 135
Benioff, P. A. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857725 · Cited by 113
Self-citationQuantum-resistance in blockchain networks
Allende, M., León, D. L., Cerón, S., Pareja, A., Pacheco, E., Leal, A., Da Silva, M., Pardo, A., Jones, D., Worrall, D. J., et al. (2023) · Scientific Reports · doi:10.1038/s41598-023-32701-6 · Cited by 109
Quantum computing for smart grid applications
Ullah, M. H., Eskandarpour, R., Zheng, H., & Khodaei, A. (2022) · IET Generation Transmission & Distribution · doi:10.1049/gtd2.12602 · Cited by 140
Secret Collusion among AI Agents: Multi-Agent Deception via Steganography
Motwani, S., Baranchuk, M., Strohmeier, M., Bolina, V., Torr, P., Hammond, L., & Witt, C. D. (2024) · Advances in Neural Information Processing Systems 37 · doi:10.52202/079017-2336 · Cited by 106
“The advent of quantum Turing machines (11) and efficient quantum algorithms may have implications on the security of steganographic schemes, such as random oracles (16).”
Efficient quantum circuits for quantum computational chemistry
Yordanov, Y. S., Arvidsson-Shukur, D. R. M., & Barnes, C. H. W. (2020) · Physical Review A · doi:10.1103/physreva.102.062612 · Cited by 126
Duong, T. Q., Nguyen, L. D., Narottama, B., Ansere, J. A., Huynh, D. V., & Shin, H. (2022) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2022.3195219 · Cited by 116
“It began in 1980 when the a quantum mechanical framework of the Turing machine was examined [14].”
MethodQUANTUM INFORMATION AND COMPUTATION
Bub, J. (2007) · Elsevier eBooks · doi:10.1016/b978-044451560-5/50009-9 · Cited by 110
Digital-analog quantum computation
Parra-Rodriguez, A., Lougovski, P., Lamata, L., Solano, E., & Sanz, M. (2020) · Physical Review A · doi:10.1103/physreva.101.022305 · Cited by 104
“More specifically, quantum computers (QC) [1–3] are believed to be faster than their classical counterparts in factoring prime numbers [4], or searching databases [5].”
BackgroundInformation is a physical entity
Landauer, R. W. (1999) · Physica A Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(98)00513-5 · Cited by 107
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
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.