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 301–400 of 1,003
A Serverless Cloud Integration For Quantum ComputingPreprint
Grossi, M., Crippa, L., Aita, A., Bartoli, G., Sammarco, V., Picca, E., Said, N., Tramonto, F., & Mattei, F. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.02007 · Cited by 43
“The idea of Quantum Computing is a concept that dates back to 80s, thanks to the work of Benioff [3] that developed a model for a quantum mechanical touring machine.”
MethodHassan, M. H., Daqaq, F., Selim, A., Domínguez‐García, J. L., & Kamel, S. M. (2023) · Soft Computing · doi:10.1007/s00500-023-08812-7 · Cited by 22
“Quantum algorithm (QA) was first proposed in Benioff (1980).”
BackgroundQi, H., He, Z.-Z., Zhao, F.-Z., & Ruan, L.-M. (2016) · International Journal of Hydrogen Energy · doi:10.1016/j.ijhydene.2016.01.112 · Cited by 25
Some Quantum Mechanical Properties of the Wolfram Model
Gorard, J. (2020) · Complex Systems · doi:10.25088/complexsystems.29.2.537 · Cited by 37
“Finally, a quantum Turing machine, rather than evolving along a single trajectory in a non-deterministic fashion, like a non-deterministic Turing machine, instead evolves a linear superposition of all possible trajectories[36][37][38]:”
BackgroundAn, N. B., & Duc, T. M. (2002) · Journal of Optics B Quantum and Semiclassical Optics · doi:10.1088/1464-4266/4/1/313 · Cited by 22
Gruska, J. (2001) · Springer eBooks · doi:10.1007/978-3-642-56478-9_27 · Cited by 25
Habibi, M. R., Golestan, S., Soltanmanesh, A., Guerrero, J. M., & Vásquez, J. C. (2022) · Electronics · doi:10.3390/electronics11182919 · Cited by 21
The Potential of Quantum Computing for Geoscience
Sahimi, M., & Tahmasebi, P. (2022) · Transport in Porous Media · doi:10.1007/s11242-022-01855-8 · Cited by 24
“In a seminal paper, physicist Paul Benioff (1980) proposed a microscopic quantum mechanical model of computers.”
BackgroundApplications of Quantum Computing in Health Sector
Arshad, M. W., Murtza, I., & Arshad, M. A. (2023) · Journal of Data Science and Intelligent Systems · doi:10.47852/bonviewjdsis3202656 · Cited by 33
Lee, Y., Boche, H., & Kutyniok, G. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3347071 · Cited by 30
“This motivates the use of analog computer models such as the Blum-Shub-Smale machine [15] or quantum computers [16].”
BackgroundMethodA Quantum-Inspired Evolutionary Algorithm for Optimization Numerical Problems
Fiasché, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34487-9_83 · Cited by 21
A Novel Quantum Swarm Evolutionary Algorithm for Solving 0-1 Knapsack Problem
Wang, Y., Feng, X., Huang, Y., Zhou, W., Liang, Y., & Zhou, C. (2005) · Lecture notes in computer science · doi:10.1007/11539117_99 · Cited by 21
A characterization of important algorithms for quantum-dot cellular automata
Lusth, J. C., & Dixon, B. J. (1999) · Information Sciences · doi:10.1016/s0020-0255(98)10033-6 · Cited by 21
Physics of selective systems: Computation and biology
Rothstein, J. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857734 · Cited by 21
Bibliographic guide to the foundations of quantum mechanics and quantum informationPreprint
Cabello, A. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0012089 · Cited by 34
“VI. QUANTUM COMPUTATION A. General [Benioff 80, 81, 82 a, b, c, 86, 95, 96, 97 a, b, 98 a, c, d], [Feynman 82] (Feynman asked whether or not the behavior of every physical system can be simulated by a computer, taking no more time than the physical system itself takes to produce the observed…”
BackgroundMethodWhat is Quantum Parallelism, Anyhow?
Markidis, S. (2024) · ISC High Performance (ISC) · doi:10.23919/isc.2024.10528926 · Cited by 32
On the effects of pseudorandom and quantum-random number generators in soft computing
Bird, J. J., Ekárt, A., & Faria, D. R. (2019) · Soft Computing · doi:10.1007/s00500-019-04450-0 · Cited by 24
“Pioneered by Paul Benioff’s 1980 work Benioff (1980), quantum computing is a system of computation that makes computational use of phenomena outside of classical physics such as the entanglement and superposition of subatomic particles Gershenfeld and Chuang (1998).”
BackgroundQuantum mechanical Hamiltonian models of discrete processes
Benioff, P. A. (1981) · Journal of Mathematical Physics · doi:10.1063/1.524938 · Cited by 20
Self-citationManenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0002 · Cited by 20
Wiesner, K. (2009) · Encyclopedia of Complexity and Systems Science · doi:10.1007/978-0-387-30440-3_426 · Cited by 19
“A contemporary paper by Benioff contains the first proposal of a quantum Turing machine (3).”
BackgroundQuantum annealing for jet clustering with thrust
Delgado, A., & Thaler, J. (2022) · Physical Review D · doi:10.1103/physrevd.106.094016 · Cited by 19
“[25] Paul Benioff, “The computer as a physical system: A microscopic quantum mechanical hamiltonian model of computers as represented by turing machines,” Journal of Statistical Physics 22, 563–591 (1980).”
BackgroundNecessary and Sufficient Conditions for Quantum Computation
Lloyd, S. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552341 · Cited by 19
Quantum Software Engineering Landscape and Challenges
Piattini, M. G., & Murillo, J. M. (2022) · Springer eBooks · doi:10.1007/978-3-031-05324-5_2 · Cited by 19
Wen, J., Wang, Z., Huang, Z., Cai, D., Jia, B., Cao, C., Ma, Y., Wei, H., Wen, K., & Qian, L. (2023) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-023-2147-3 · Cited by 21
Comparing CMOS-Based and NEMS-Based Adiabatic Logic Circuits
Houri, S., Valentian, A., & Fanet, H. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38986-3_4 · Cited by 19
Fan, K., O’Sullivan, C., Brabazon, A., & O’Neill, M. (2008) · Studies in computational intelligence · doi:10.1007/978-3-540-77477-8_6 · Cited by 19
A note on quantum sequential machines
Li, L., & Qiu, D. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.08.026 · Cited by 21
“Quantum computers—the physical devices complying with the rules of quantum mechanics were first considered by Benioff [8], and then suggested by Feynman [11].”
MethodQuantum Computing and Shor's Algorithm
Hayward, M. W. (2015) · Cited by 24
Quantum cellular automata and quantum field theory in two spatial dimensions
Brun, T. A., & Mlodinow, L. D. (2020) · Physical Review A · doi:10.1103/physreva.102.062222 · Cited by 25
“In the four decades since Paul Benioff hatched the idea of a quantum computer [1], the field of quantum information has grown into one of the pillars of theoretical physics.”
BackgroundA novel fault-tolerant quantum divider and its simulation
Yuan, S., Gao, S., Wen, C., Wang, Y., Qu, H., & Wang, Y. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03523-8 · Cited by 23
Theory and application of Fermi pseudo-potential in one dimension
Wu, T. T., & Yu, M. L. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1519940 · Cited by 19
Classical emulation of a quantum computer
Cour, B. R. L., Ostrove, C. I., Ott, G. E., Starkey, M. J., & Wilson, G. R. (2016) · International Journal of Quantum Information · doi:10.1142/s0219749916400049 · Cited by 19
Reasoning about Grover's quantum search algorithm using probabilistic wp
Butler, M. J., & Hartel, P. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/319301.319303 · Cited by 19
“It is demonstrated that the calculus provides a rigorous programming notation for modeling this and other quantum algorithms and that it also provides a systematic framework of analyzing such algorithms.”
BackgroundQuantum computation algorithm for many-body studiesPreprint
Ovrum, E., & Hjorth-Jensen, M. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0705.1928 · Cited by 36
Introduction to Quantum Information ProcessingPreprint
Knill, E. H., Laflamme, R., Barnum, H., Dalvit, D. A. R., Dziarmaga, J., Gubernatis, J. E., Gurvits, L., Ortíz, G., Viola, L., & Zurek, W. H. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0207171 · Cited by 30
When energy and information revolutions meet 2D Janus
Zhang, L., Ren, Z., Sun, L. M., Gao, Y., Wang, D., He, J., & Gao, G. (2025) · Applied Physics Reviews · doi:10.1063/5.0306801 · Cited by 22
A Novel Hybrid Quantum Architecture for Path Planning in Quantum-Enabled Autonomous Mobile Robots
Sarkar, M., Pradhan, J., Singh, A. K., & Nenavath, H. (2024) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2024.3423416 · Cited by 18
“Quantum computing started its journey from the proposal of a quantum equivalent of the Turing machine by Benioff [19], [20].”
Potential Development on Cyberattack and Prospect Analysis for Cybersecurity
Li, L., Thakur, K., & Ali, M. L. (2020) · IEEE International IOT, Electronics and Mechatronics Conference (IEMTRONICS) · doi:10.1109/iemtronics51293.2020.9216374 · Cited by 20
“So, as in extreme cases, one quantum computer has the ability to compete for 16 traditional computers if the size of memory is restricted to 4-bit [12].”
BackgroundMechanism of Electron-Beam Manipulation of Single-Dopant Atoms in Silicon
Markevich, A., Hudak, B. M., Madsen, J., Song, J., Snijders, P. C., Lupini, A. R., & Susi, T. (2021) · The Journal of Physical Chemistry C · doi:10.1021/acs.jpcc.1c03549 · Cited by 18
A comparative study of universal quantum computing models: Toward a physical unification
Wang, D. (2021) · Quantum Engineering · doi:10.1002/que2.85 · Cited by 23
“The very concept of quantum computing was originally established by the study of modeling, either based on Hamiltonian or circuits [1, 2, 3, 4], and the quantum circuit model is the most well-known one [5, 6].”
BackgroundDai, H., Yu, Y., Li, C., Shi, J., Gao, S., & Tang, Z. (2009) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.e92.d.78 · Cited by 18
“[7] P. Benioff, “The computer as a phusical system: A microscopic quantum mechanical hamiltonian model of computers as represented by turing mechines,” J. Stat.”
BackgroundQubit Geometry and Conformal Mapping
Lee, J. W., Kim, C. H., Lee, E. K., Kim, J., & Lee, S. (2002) · Quantum Information Processing · doi:10.1023/a:1019645000745 · Cited by 18
Yamakami, T. (2003) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054103002047 · Cited by 24
“A paradigm of a quantum mechanical computer was first proposed in the 1980s [3, 11, 18] to exercise more computational power over the silicon-based computer, whose development is speculated to face a physical barrier.”
Kirilyuk, A. P. (2002) · arXiv (Cornell University) · Cited by 18
Local Hamiltonians in Quantum ComputationPreprint
Nagaj, D. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0808.2117 · Cited by 37
Image Processing in Quantum ComputersPreprint
Dendukuri, A., & Luu, K. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.11042 · Cited by 24
“The idea of quantum information was first introduced in 1980 by Paul Benioff [1].”
BackgroundQuantum-Resistance in Blockchain Networks
López, M. A., León, D. L., Cerón, S., Batista, A. L., Pareja, A., da Silva, M. M., Pardo, A., Jones, D., Worrall, D., Merriman, B., et al. (2021) · doi:10.18235/0003313 · Cited by 20
Minimizing Delay in Network Function Visualization with Quantum Computing
Xuan, W., Zhao, Z., Fan, L., & Han, Z. (2021) · IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) · doi:10.1109/mass52906.2021.00022 · Cited by 17
Quantum Computing: Principles and Applications
Feng, G., Lu, D., Li, J., Xin, T., & Zeng, B. (2023) · SPIN · doi:10.1142/s2010324723300013 · Cited by 18
Yu, G., Wu, C., Liu, Y., Du, Z., Zhao, N., Jiao, Y., Xu, Z., & Shi, W. (2023) · Science China Earth Sciences · doi:10.1007/s11430-022-1144-7 · Cited by 20
“In 1980, a quantum mechanical model was constructed for standard Turing machines (Benioff, 1980).”
MethodQuantum Communication Networks for Energy Applications: Review and Perspective
Paudel, H. P., Crawford, S. E., Lee, Y., Shugayev, R., Leuenberger, M. N., Syamlal, M., Ohodnicki, P. R., Lu, P., Mollot, D., & Duan, Y. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300096 · Cited by 29
Enhancing the expressivity of quantum neural networks with residual connections
Wen, J., Huang, Z., Cai, D., & Qian, L. (2024) · Communications Physics · doi:10.1038/s42005-024-01719-1 · Cited by 31
Quantum cooperative search algorithm for 3-SAT
Cheng, S.-T., & Tao, M. (2006) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2006.09.003 · Cited by 24
QPCF: Higher-Order Languages and Quantum Circuits
Paolini, L., Piccolo, M., & Zorzi, M. (2019) · Journal of Automated Reasoning · doi:10.1007/s10817-019-09518-y · Cited by 17
Procedural generation using quantum computation
Wootton, J. R. (2020) · International Conference on the Foundations of Digital Games (FDG) · doi:10.1145/3402942.3409600 · Cited by 28
“simply add a 0 to the end of each bit string. For the second we reverse the order and then add a 1 to the end of each bit string. Finally, these two lists are concatenated. For example, starting with [0;1] we get [00;10] for the original list with appended 0, and [11;01] for the reversed list with appended 1. These co…”
BackgroundQuantum Game Jam – Making Games with Quantum Physicists
Kultima, A., Piispanen, L. J., & Junnila, M. (2021) · International Academic Mindtrek Conference (Mindtrek) · doi:10.1145/3464327.3464349 · Cited by 19
AN ALGORITHM FOR MINIMUM SPACE QUANTUM BOOLEAN CIRCUITS CONSTRUCTION
Tsai, I.-M., & Kuo, S. (2006) · Journal of Circuits Systems and Computers · doi:10.1142/s0218126606003349 · Cited by 17
Error rate of the Kane quantum computer controlled-NOT gate in the presence of dephasing
Fowler, A. G., Wellard, C. J., & Hollenberg, L. C. L. (2003) · Physical Review A · doi:10.1103/physreva.67.012301 · Cited by 17
From Quantum Metalanguage to the Logic of QubitsPreprint
Zizzi, P. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1003.5976 · Cited by 19
“e need for a closer relationship between Quantum logic and quantum computing. The advances in the latter domain, originated in the eighties from the seminal work of Benioff, Feynman, and Deutsch (see Benioff, 1980; Feynman, 1982, 1986; Deutsch, 1985), became impetuous after Shor (the original paper dates to 1994, but…”
BackgroundWiesner, K. (2013) · Springer eBooks · doi:10.1007/978-3-642-27737-5_426-4 · Cited by 17
Feature Selection of Grey Wolf Optimizer Based on Quantum Computing and Uncertain Symmetry Rough Set
Zhao, G., Wang, H., Jia, D., & Wang, Q. (2019) · Symmetry · doi:10.3390/sym11121470 · Cited by 16
“Quantum inspired computing is a new field of computer intelligence, which is a new computing method, based on quantum mechanics theory [34].”
MethodUsing Quantum computers to speed up dynamic testing of software
Miranskyy, A. V. (2022) · doi:10.1145/3549036.3562061 · Cited by 24
“1 Body of g(~z) It is theoretically possible to convert any CC program into a QC program (because QC implements a quantum Turing machine [6, 2]), but there are limitations and practical considerations (see Section 4).”
BackgroundA Friendly Guide to Exorcising Maxwell’s Demon
de Oliveira, A., Brask, J. B., & Chaves, R. (2025) · PRX Quantum · doi:10.1103/phkv-wrsd · Cited by 26
Forecasting Fossil Fuel Energy Consumption for Power Generation Using QHSA-Based LSSVM Model
Sun, W., He, Y., & Hong, C. (2015) · Energies · doi:10.3390/en8020939 · Cited by 17
“The concept of quantum computing is presented by Benioff [49] and Feynman [50] in the 1980s through combing quantum theory and information science.”
BackgroundQuantum Information Processing
Lloyd, S. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1800-9_153 · Cited by 17
A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
Yamakami, T. (2020) · Journal of Symbolic Logic · doi:10.1017/jsl.2020.45 · Cited by 27
Blockchain in the Quantum World
Faridi, A. R., Masood, F., Shamsan, A. H., Luqman, M., & Salmony, M. Y. (2022) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2022.0130167 · Cited by 16
“Paul Benioff, an Argonne National Labs scientist, wrote a paper in 1979 that showed the theoretical foundation for quantum computing [1] and suggested that a quantum computer might be developed.”
BackgroundQuantum Version of the k‐NN Classifier Based on a Quantum Sorting Algorithm
Quezada, L. F., Sun, G.-H., & Dong, S. (2022) · Annalen der Physik · doi:10.1002/andp.202100449 · Cited by 16
“On the other hand, quantum computing emerged in 1980 with the work of Paul Benioff [5], in which a quantum model of the Turing machine was proposed.”
MethodInfluentialDigital-analog quantum computation with arbitrary two-body Hamiltonians
de Andoin, M. G., Sáiz, Á., Pérez-Fernández, P., Lamata, L., Oregi, I., & Sanz, M. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013280 · Cited by 21
“When quantum computing was originally proposed [1, 2], it was envisioned as a way of simulating the dynamics of a quantum system employing another controllable system.”
MethodBrain-, Gene-, and Quantum Inspired Computational Intelligence: Challenges and Opportunities
Kasabov, N. K. (2007) · Studies in computational intelligence · doi:10.1007/978-3-540-71984-7_9 · Cited by 16
Kluge, W. E. (2000) · Lecture notes in computer science · doi:10.1007/10722298_6 · Cited by 18
“Reversible computations on the gate level have been shown to be theoretically feasible by devising various gates, simple automata [3,18,10], and a reversible Turing machine [4,5].”
MethodQuantum logic and automata theory
Ying, M. (2007) · Elsevier eBooks · doi:10.1016/b978-044452870-4/50037-6 · Cited by 16
Understanding quantum entanglement by thermo field dynamics
Hashizume, Y., & Suzuki, M. (2013) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.04.022 · Cited by 26
Free Search with Adaptive Differential Evolution Exploitation and Quantum-Inspired Exploration
Yin, J., Wang, Y., & Hu, J. (2011) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2011.12.004 · Cited by 16
“There are mainly two categories in the research of this field: building quantum computers (Benioff, 1980; Feynman, 1982; Deutsch, 1985) and designing quantum algorithms (Shor, 1994; Grover, 1996).”
BackgroundQuantum Key Distribution Protocols and Applications
Cobourne, S. (2011) · Cited by 23
On circuit models for quantum‐classical networks
Csurgay, Á. I. (2007) · International Journal of Circuit Theory and Applications · doi:10.1002/cta.444 · Cited by 17
“It has been shown that, at least in principle, quantum-mechanical computers can be constructed [61].”
BackgroundFerry, D. K., Akis, R., & Harris, J. (2001) · Superlattices and Microstructures · doi:10.1006/spmi.2001.0998 · Cited by 18
Quantum noise in reversible soliton logic
Drummond, P. D., & Man, W. S. (1994) · Optics Communications · doi:10.1016/0030-4018(94)90301-8 · Cited by 17
Classical and Quantum Information
Plekhanov, V. G. (2012) · SpringerBriefs in physics · doi:10.1007/978-3-642-28750-3_3 · Cited by 16
Quantum simulation: From basic principles to applications
Sanchez-Palencia, L. (2018) · Comptes Rendus Physique · doi:10.1016/j.crhy.2018.11.005 · Cited by 18
“This is actually nothing but a quantum computer [22,23,24,25].”
BackgroundFractional-order quantum particle swarm optimization
Xu, L., Aamir, M., Pu, Y., Zhou, J., & Zhang, Y. (2019) · PLoS ONE · doi:10.1371/journal.pone.0218285 · Cited by 15
Scalable qubit representations of neutrino mixing matrices
Molewski, M. J., & Jones, B. J. P. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.105.056024 · Cited by 15
“Quantum simulation, as popularized by Feynman [8] and others [9, 10], involves encoding the dynamics of a system under study in the Hilbert space of a quantum processor in order to solve for its time evolution with application of an appropriately encoded time evolution operator.”
MethodDemonstration of a two-bit controlled-NOT quantum-like gate using classical acoustic qubit-analogues
Runge, K., Hasan, M. A., Levine, J. A., & Deymier, P. A. (2022) · Scientific Reports · doi:10.1038/s41598-022-18314-5 · Cited by 19
Quantum Inspired Algorithm for a VRP with Heterogeneous Fleet Mixed Backhauls and Time Windows
Berghida, M., & Boukra, A. (2016) · International Journal of Applied Metaheuristic Computing · doi:10.4018/ijamc.2016100102 · Cited by 15
“Another area of research called Quantum Computing (Benioff, 1980) has recently emerged.”
BackgroundQuantum computing with classical bits
WETTERICH, C. (2019) · Nuclear Physics B · doi:10.1016/j.nuclphysb.2019.114776 · Cited by 21
Computational Power of Infinite Quantum Parallelism
Ziegler, M. (2005) · International Journal of Theoretical Physics · doi:10.1007/s10773-005-8984-0 · Cited by 15
Quantum ballistic evolution in quantum mechanics: Application to quantum computers
Benioff, P. A. (1996) · Physical Review A · doi:10.1103/physreva.54.1106 · Cited by 21
Self-citationCarlini, A., & Hosoya, A. (2001) · Physics Letters A · doi:10.1016/s0375-9601(01)00025-1 · Cited by 17
Quantum logic using polarized photons
Törmä, P., & Stenholm, S. (1996) · Physical Review A · doi:10.1103/physreva.54.4701 · Cited by 14
Renaissance minds in 21st century science
Yanai, I., & Lercher, M. J. (2020) · Genome biology · doi:10.1186/s13059-020-01985-6 · Cited by 15
On the effects of biased quantum random numbers on the initialization of artificial neural networks
Heese, R., Wolter, M., Mücke, S., Franken, L., & Piatkowski, N. (2024) · Machine Learning · doi:10.1007/s10994-023-06490-y · Cited by 17
“A quantum computer is a processor which utilizes quantum mechanical phenomena to process information (Benioff, 1980, Grumbling and Horowitz, 2019).”
MethodQuantum information technology: Current status and prospects
Pan, J.-W. (2023) · Acta Physica Sinica · doi:10.7498/aps.73.20231795 · Cited by 15
Quantum computing with trapped ions: principles, achievements, and prospects
Zalivako, I. V., Semenin, N. V., Zhadnov, N. O., Galstyan, K. P., Kamenskikh, P. A., Smirnov, V. N., Korolkov, A. E., Leonidovich, S. P., Borisenko, A. S., Anosov, Y. P., et al. (2024) · Physics-Uspekhi · doi:10.3367/ufne.2024.12.039884 · Cited by 19
Classical and quantum-inspired electromagnetism-like mechanism and its applications
Chou, Y., Chen, C.-Y., Chiu, C.-H., & Chao, H. (2012) · IET Control Theory and Applications · doi:10.1049/iet-cta.2011.0382 · Cited by 14
Liu, W., Chen, J., Wang, Y., Gao, P., Lei, Z., & Ma, X. (2020) · Complexity · doi:10.1155/2020/8216874 · Cited by 14
“On the other hand, since Benioff [23] and Feynman [24] explored the theoretical possibilities of quantum computing, some excellent results have been proposed one after another.”
BackgroundTime delay in atomic and molecular collisions and photoionisation/photodetachment
Deshmukh, P. C., & Banerjee, S. (2020) · International Reviews in Physical Chemistry · doi:10.1080/0144235x.2021.1838805 · Cited by 16
Quantum Algorithms for Testing Hamiltonian Symmetry
LaBorde, M. L., & Wilde, M. M. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.160503 · Cited by 35
Gan, W. S. (2022) · Springer eBooks · doi:10.1007/978-981-19-0983-2_13 · Cited by 14
A Compare between Shor's quantum factoring algorithm and General Number Field Sieve
Hamdi, S. M., Zuhori, S. T., Mahmud, F., & Pal, B. (2014) · International Conference on Electrical Engineering and Information Communication Technology · doi:10.1109/iceeict.2014.6919115 · Cited by 23
Gupta, S., Sau, K., Pramanick, J., Pyne, S., Ahamed, R., & Biswas, R. (2017) · International Conference on Internet of Everything, Microwave Engineering, Communication and Networks (IEMECON) · doi:10.1109/iemecon.2017.8079582 · Cited by 15
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.