Simulating physics with computers
The DOI matches its Crossref record; 9 of the 9 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
“Thus, as Feynman argued [9], the simulation of highly entangled quantum matter is the natural arena where quantum computers seem to have a clear advantage over classical ones.”
From Quantum Computing in the NISQ era and beyond (2018) · cites this paper as [9]
In the citing paper
“As first proposed by Feynman [1], a possible solution is for the model itself to operate via quantum instead of classical dynamics, either through simulation, in which a digital model on a quantum computer yields physical quantities as in e.g.[2][3][4], or through emulation, in which a quantum system is modelled by a better-controllable system with a sufficiently similar Hamiltonian.”
From Two-photon quantum walks in an elliptical direct-write waveguide array (2011) · cites this paper as [1]
In the citing paper
“He proposed to use quantum systems that are well-controlled in the lab to simulate other quantum systems of interest (Feynman, 1982).”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Feynman, 1982
In the citing paper
“Owing to their quantum-mechanical nature, quantum computers offer a way to simulate even large-scale manybody systems (von Burg et al. , 2020; Feynman, 1982).”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Feynman, 1982
In the citing paper
“The real existence of Zitterbewegung , in relativistic quantum mechanics and in quantum field theory, has been a recurrent subject of discussion in the last years [13, 14].”
From Quantum simulation of the Dirac equation (2010) · cites this paper as [14]
14 more claims about this paper
Create a free account to see every claim other papers make about this one.
Citations
Cites
Space-Time Approach to Non-Relativistic Quantum Mechanics
Feynman, R. P. (1948) · Reviews of Modern Physics · doi:10.1103/revmodphys.20.367 · Cited by 4,271
Self-citation(1985) · Cited by 860
Self-citationFeynman Lectures on Computation
Feynman, R. P. (2018) · CRC Press eBooks · doi:10.1201/9780429500442 · Cited by 522
Self-citationDyson, F. J., & Bethe, H. A. (1979) · Physics Today · doi:10.1063/1.2995315 · Cited by 225
Chambers, E. E., & Hofstadter, R. (1956) · Physical Review · doi:10.1103/physrev.103.1454 · Cited by 142
The λ -Transition in Liquid Helium
Feynman, R. P. (1953) · Physical Review · doi:10.1103/physrev.90.1116.2 · Cited by 100
Self-citationThe Beat of a Different Drum: The Life and Science of Richard Feynman
Mehra, J., & Kragh, H. (1994) · American Journal of Physics · doi:10.1119/1.17619 · Cited by 82
Richard Feynman: A Life in Science
Gribbin, J. R., & Gribbin, M. (1997) · International Linear Collider · Cited by 32
Richard Feynman and the Connection Machine
Hillis, W. D. (1989) · Physics Today · doi:10.1063/1.881196 · Cited by 18
Cited by
Items 701–800 of 1,097
Classical Optimizers for Noisy Intermediate-Scale Quantum Devices
Lavrijsen, W., Tudor, A., Muller, J., Iancu, C., & de Jong, W. (2020) · 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00041 · Cited by 97
Quantum-inspired ant lion optimized hybrid k-means for cluster analysis and intrusion detection
Chen, J., Qi, X., Chen, L., Chen, F., & Cheng, G. (2020) · Knowledge-Based Systems · doi:10.1016/j.knosys.2020.106167 · Cited by 103
Business Renaissance: Opportunities and Challenges at the Dawn of the Quantum Computing Era
How, M.-L., & Cheah, S.-M. (2023) · Businesses · doi:10.3390/businesses3040036 · Cited by 143
“While strides have been made with algorithms like Shor’s (for factoring large numbers) or Grover’s (for searching unsorted databases), many real-world business problems still lack efficient quantum algorithms [22,23].”
BackgroundMethodQuantum image processing (QuIP)
Beach, G., Lomont, C., & Cohen, C. J. (2004) · Proceedings · doi:10.1109/aipr.2003.1284246 · Cited by 103
Computation: A Fundamental Physical View
Landauer, R. W. (1987) · Physica Scripta · doi:10.1088/0031-8949/35/1/021 · Cited by 106
Classical Optimizers for Noisy Intermediate-Scale Quantum Devices
Lavrijsen, W., Tudor, A., Müller, J., Iancu, C., & de Jong, W. (2020) · arXiv · doi:10.48550/arxiv.2004.03004 · Cited by 103
Quantum metaphysical indeterminacy
Calosi, C., & Wilson, J. (2018) · Philosophical Studies · doi:10.1007/s11098-018-1143-2 · Cited by 133
Characterizing and Optimizing Qubit Coherence Based on SQUID Geometry
Braumüller, J., Ding, L., Vepsäläinen, A. P., Sung, Y., Kjærgaard, M., Menke, T., Winik, R., Kim, D. K., Niedzielski, B. M., Melville, A. J., et al. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.13.054079 · Cited by 103
Conformal field theories are magical
White, C. D., Cao, C., & Swingle, B. (2021) · Physical Review B · doi:10.1103/physrevb.103.075145 · Cited by 93
Quantum Power Method by a Superposition of Time-Evolved States
Seki, K., & Yunoki, S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010333 · Cited by 144
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 136
Quantum Computing: Lecture NotesPreprint
de Wolf, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.09415 · Cited by 222
“The two main successes of quantum algorithms so far are Shor’s factoring algorithm from 1994 [129] and Grover’s search algorithm from 1996 [74], which will be explained in later chapters.”
BackgroundMethodAltaisky, M. V. (2001) · arXiv · doi:10.48550/arxiv.quant-ph/0107012 · Cited by 101
Cavity-QED simulation of qubit-oscillator dynamics in the ultrastrong-coupling regime
Grimsmo, A. L., & Parkins, A. S. (2013) · Physical Review A · doi:10.1103/physreva.87.033814 · Cited by 116
Quantum perceptron over a field and neural network architecture selection in a quantum computer
da Silva, A. J., Ludermir, T. B., & de Oliveira, W. R. (2016) · Neural Networks · doi:10.1016/j.neunet.2016.01.002 · Cited by 101
“For instance, the Grover’s search algorithm [4] and Shor’s factoring algorithm [5] overcome any known classical algorithm.”
MethodEfficient arbitrary simultaneously entangling gates on a trapped-ion quantum computer
Grzesiak, N., Blümel, R., Wright, K., Beck, K. M., Pisenti, N. C., Li, M., Chaplin, V., Amini, J. M., Debnath, S., Chen, J.-S., et al. (2020) · Nature Communications · doi:10.1038/s41467-020-16790-9 · Cited by 101
“• Quantum arithmetic circuits [19, 20] – useful for solving an integer factoring problem or computing discrete logarithms over Abelian groups [1].”
BackgroundMethodSolving Gauss's law on digital quantum computers with loop-string-hadron digitization
Raychowdhury, I., & Stryker, J. R. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033039 · Cited by 159
Many-Body Physics in the NISQ Era: Quantum Programming a Discrete Time Crystal
Ippoliti, M., Kechedzhi, K., Moessner, R., Sondhi, S. L., & Khemani, V. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030346 · Cited by 132
Alexeev, Y., Amsler, M., Barroca, M. A., Bassini, S., Battelle, T., Camps, D., Casanova, D., Choi, Y. J., Chong, F. T., Chung, C., et al. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.04.060 · Cited by 191
Chow, J. C. L. (2024) · Medical Sciences · doi:10.3390/medsci12040067 · Cited by 159
Quantum Software Engineering: Roadmap and Challenges Ahead
Murillo, J. M., García-Alonso, J. M., Moguel, E., Barzen, J., Leymann, F., Ali, S., Yue, T., Arcaini, P., Pérez‐Castillo, R., de Guzmán, I. G., et al. (2025) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3712002 · Cited by 200
“For example, Shor’s algorithm [163] provides an exponential speedup for factoring large integers, reducing the time complexity from sub-exponential (classical) to polynomial (quantum).”
Universal simulation of Markovian quantum dynamics
Bacon, D., Childs, A. M., Chuang, I. L., Kempe, J., Leung, D. W., & Zhou, X. (2001) · Physical Review A · doi:10.1103/physreva.64.062302 · Cited by 103
Quantum mechanics of lattice gas automata: One-particle plane waves and potentials
Meyer, D. A. (1997) · Physical Review E · doi:10.1103/physreve.55.5261 · Cited by 101
Quantum computing for near-term applications in generative chemistry and drug discovery.
Pyrkov, A., Aliper, A., Bezrukov, D., Lin, Y.-C., Polykovskiy, D., Kamya, P., Ren, F., & Zhavoronkov, A. (2023) · Drug Discovery Today · doi:10.1016/j.drudis.2023.103675 · Cited by 100
Confirmation via Analogue Simulation: What Dumb Holes Could Tell Us about Gravity
Dardashti, R., Thébault, K. P. Y., & Winsberg, E. B. (2015) · The British Journal for the Philosophy of Science · doi:10.1093/bjps/axv010 · Cited by 125
“17See (Deutsch 1985; Bernstein and Vazirani 1993; Shor 1997) for key historical developments, and see (Nielsen and Chuang 2010; Timpson 2013) for general reference.”
BackgroundQuantum technology: from research to application
Schleich, W. P., Ranade, K. S., Anton, C., Arndt, M., Aspelmeyer, M., Bayer, M., Berg, G., Calarco, T., Fuchs, H., Giacobino, E., et al. (2016) · Applied Physics B · doi:10.1007/s00340-016-6353-8 · Cited by 115
Cybersecurity Challenges Associated With the Internet of Things in a Post-Quantum World
Althobaiti, O. S., & Döhler, M. (2020) · IEEE Access · doi:10.1109/access.2020.3019345 · Cited by 122
“One of the most popular explanations of the electron spin phenomena is given by nuclear magnetic resonance experiments [22].”
BackgroundSingle qudit realization of the Deutsch algorithm using superconducting many-level quantum circuits
Kiktenko, E. O., Fedorov, A. K., Strakhov, A. A., & Man’ko, V. I. (2015) · Physics Letters A · doi:10.1016/j.physleta.2015.03.023 · Cited by 112
Quantum-inspired Multiobjective Evolutionary Algorithm for Multiobjective 0/1 Knapsack Problems
Kim, Y.-H., Kim, J.-H., & Han, K.-H. (2006) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2006.1688633 · Cited by 114
Quantum simulation of the Hubbard model with dopant atoms in silicon
Salfi, J., Mol, J. A., Rahman, R., Klimeck, G., Simmons, M. Y., Hollenberg, L. C. L., & Rogge, S. M. J. (2016) · Nature Communications · doi:10.1038/ncomms11342 · Cited by 103
Microcavity exciton polaritons at room temperature
Ghosh, S., Su, R., Zhao, J., Fieramosca, A., Jin-qi, W., Li, T., Zhang, Q., Li, F., Chen, Z., Liew, T. C. H., et al. (2022) · Photonics Insights · doi:10.3788/pi.2022.r04 · Cited by 118
“It was suggested by Feynman that quantum devices would be better for modeling certain systems that cannot be efficiently done by classical devices [165] .”
BackgroundBerthiaume, A., & Brassard, G. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552351 · Cited by 99
Brown, K. R., Clark, R. J., & Chuang, I. L. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.050504 · Cited by 98
The nature of the Extended Analog Computer
Mills, J. W. (2008) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2008.03.041 · Cited by 107
Maximal Entanglement in High Energy Physics
Cervera-Lierta, A., Latorre, J. I., Rojo, J., & Rottoli, L. (2017) · SciPost Physics · doi:10.21468/scipostphys.3.5.036 · Cited by 148
“Large entanglement is expected to be present in quantum registers when a quantum algorithm produces a relevant advantage in performance over a classical computer such as Shor’s algorithm [5].”
BackgroundQX: A high-performance quantum computer simulation platform
Khammassi, N., Ashraf, I., Fu, X., Almudever, C. G., & Bertels, K. (2017) · Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017 · doi:10.23919/date.2017.7927034 · Cited by 94
Digital-analog quantum simulations with superconducting circuits
Lamata, L., Parra-Rodriguez, A., Sanz, M., & Solano, E. (2018) · Advances in Physics: X · doi:10.1080/23746149.2018.1457981 · Cited by 93
Quantum computing in power systems
Zhou, Y., Tang, Z., Nikmehr, N., Babahajiani, P., Feng, F., Wei, T.-C., Zheng, H., & Zhang, P. (2022) · iEnergy · doi:10.23919/ien.2022.0021 · Cited by 128
Roadmap for unconventional computing with nanotechnology
Finocchio, G., Incorvia, J. A. C., Friedman, J. S., Qu, Y., Giordano, A., Grollier, J., Yang, H., Ciubotaru, F., Chumak, A. V., Naeemi, A., et al. (2024) · Nano Futures · doi:10.1088/2399-1984/ad299a · Cited by 139
Deterministic implementation of weak quantum cubic nonlinearity
Marek, P., Filip, R., & Furusawa, A. (2011) · Physical Review A · doi:10.1103/physreva.84.053802 · Cited by 99
Qubit devices and the issue of quantum decoherence
Brandt, H. E. (1999) · Progress in Quantum Electronics · doi:10.1016/s0079-6727(99)00003-8 · Cited by 120
Simulating an Interacting Gauge Theory with Ultracold Bose Gases
Edmonds, M., Valiente, M., Juzeliūnas, G., Santos, L., & Öhberg, P. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.085301 · Cited by 101
Itin, A. P., & Katsnelson, M. I. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.075301 · Cited by 121
“for construction of quantum simulators (wellcontrollable quantum systems for simulating complicated condensed matter phenomena [6, 7]).”
A quantum inspired gravitational search algorithm for numerical function optimization
Soleimanpour-Moghadam, M., Nezamabadi–pour, H., & Farsangi, M. M. (2013) · Information Sciences · doi:10.1016/j.ins.2013.09.006 · Cited by 97
An improved sparrow search algorithm based on quantum computations and multi-strategy enhancement
Wu, R., Huang, H., Wei, J., Ma, C., Zhu, Y., Chen, Y., & Fan, Q. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.119421 · Cited by 101
Preparations for quantum simulations of quantum chromodynamics in 1+1 dimensions. I. Axial gauge
Farrell, R. C., Chernyshev, I. A., Powell, S. J. M., Zemlevskiy, N. A., Illa, M., & Savage, M. J. (2023) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.107.054512 · Cited by 178
Discrete differential calculus: Graphs, topologies, and gauge theory
Dimakis, A., & Müller-Hoissen, F. (1994) · Journal of Mathematical Physics · doi:10.1063/1.530638 · Cited by 104
Entanglement in quantum information theoryPreprint
Eisert, J. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0610253 · Cited by 168
A quantum-inspired gravitational search algorithm for binary encoded optimization problems
Nezamabadi–pour, H. (2015) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2015.01.002 · Cited by 98
Quantum simulation of the single-particle Schrödinger equation
Benenti, G., & Strini, G. (2008) · American Journal of Physics · doi:10.1119/1.2894532 · Cited by 92
QSobel: A novel quantum image edge extraction algorithm
Zhang, Y., Lü, K., & Gao, Y. (2014) · Science China Information Sciences · doi:10.1007/s11432-014-5158-9 · Cited by 97
Digital quantum simulation of molecular vibrations
McArdle, S., Mayorov, A., Shan, X., Benjamin, S., & Yuan, X. (2019) · Chemical Science · doi:10.1039/c9sc01313j · Cited by 99
Design and analysis of photonic crystal coupled cavity arrays for quantum simulation
Majumdar, A., Rundquist, A., Bajcsy, M., Dasika, V. D., Bank, S. R., & Vučković, J. (2012) · Physical Review B · doi:10.1103/physrevb.86.195312 · Cited by 107
Scalable architecture for spin-based quantum computers with a single type of gate
Suter, D., & Lim, K. (2002) · Physical Review A · doi:10.1103/physreva.65.052309 · Cited by 97
Integrated-optics heralded controlled-NOT gate for polarization-encoded qubits
Zeuner, J., Sharma, A. N., Tillmann, M., Heilmann, R., Gräfe, M., Moqanaki, A., Szameit, A., & Walther, P. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0068-0 · Cited by 95
Classical simulation versus universality in measurement-based quantum computation
Van den Nest, M., Dür, W., Vidal, G., & Briegel, H. J. (2007) · Physical Review A · doi:10.1103/physreva.75.012337 · Cited by 95
Recent progress in quantum algorithms
Bacon, D., & van Dam, W. (2010) · Communications of the ACM · doi:10.1145/1646353.1646375 · Cited by 95
Breaking the 49-Qubit Barrier in the Simulation of Quantum Circuits
Pednault, E., Gunnels, J. A., Nannicini, G., Horesh, L., Magerlein, T., Solomonik, E., & Wisnieff, R. (2018) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · Cited by 107
A Full Quantum Eigensolver for Quantum Chemistry Simulations
Wei, S., Li, H., & Long, G. (2020) · Research · doi:10.34133/2020/1486935 · Cited by 111
Classification and reconstruction of optical quantum states with deep neural networks
Ahmed, S., Muñoz, C. S., Nori, F., & Kockum, A. F. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033278 · Cited by 119
Kim, I. H., Liu, Y.-H., Pallister, S., Pol, W., Roberts, S., & Lee, E. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023019 · Cited by 96
Quantum entanglement and Bell inequality violation at colliders
Barr, A. J., Fabbrichesi, M. E., Floreanini, R., Gabrielli, E., & Marzola, L. (2024) · Progress in Particle and Nuclear Physics · doi:10.1016/j.ppnp.2024.104134 · Cited by 190
Quantum Dot Systems: a versatile platform for quantum simulations
Barthelemy, P., & Vandersypen, L. M. K. (2013) · Annalen der Physik · doi:10.1002/andp.201300124 · Cited by 114
Higher-order methods for simulations on quantum computers
Sornborger, A. T., & Stewart, E. D. (1999) · Physical Review A · doi:10.1103/physreva.60.1956 · Cited by 94
Grammaticos, B., Nijhoff, F. W., & Ramani, A. (1999) · Springer eBooks · doi:10.1007/978-1-4612-1532-5_7 · Cited by 119
A survey on HHL algorithm: From theory to application in quantum machine learning
Duan, B., Yuan, J., Yu, C., Huang, J., & Hsieh, C. (2020) · Physics Letters A · doi:10.1016/j.physleta.2020.126595 · Cited by 120
Universal Quantum Computation Based on Nanoscale Skyrmion Helicity Qubits in Frustrated Magnets
Xia, J., Zhang, X., Liu, X., Zhou, Y., & Ezawa, M. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.106701 · Cited by 114
Using Concatenated Quantum Codes for Universal Fault-Tolerant Quantum Gates
Jochym-O’Connor, T., & Laflamme, R. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.010505 · Cited by 96
Shadows and Mirrors: Reconstructing Quantum States of Atom Motion
Leibfried, D., Pfau, T., & Monroe, C. (1998) · Physics Today · doi:10.1063/1.882256 · Cited by 92
Gauge P representations for quantum-dynamical problems: Removal of boundary terms
Deuar, P., & Drummond, P. D. (2002) · Physical Review A · doi:10.1103/physreva.66.033812 · Cited by 97
Quantum random walk with Rydberg atoms in an optical lattice
Côté, R., Russell, A., Eyler, E. E., & Gould, P. L. (2006) · New Journal of Physics · doi:10.1088/1367-2630/8/8/156 · Cited by 100
Foundations for Near-Term Quantum Natural Language ProcessingPreprint
Coecke, B., de Felice, G., Meichanetzidis, K., & Toumi, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.03755 · Cited by 171
Quantum Computing for Molecular Biology**
Baiardi, A., Christandl, M., & Reiher, M. (2023) · ChemBioChem · doi:10.1002/cbic.202300120 · Cited by 93
Grimsley, H. R., Barron, G. S., Barnes, E., Economou, S. E., & Mayhall, N. J. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00681-0 · Cited by 93
Trapped ions in optical lattices for probing oscillator chain models
Pruttivarasin, T., Ramm, M. T., Talukdar, I., Kreuter, A., & Häffner, H. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/7/075012 · Cited by 110
Quantum information processing and metrology with trapped ions
Wineland, D. J., & Leibfried, D. G. (2011) · Laser Physics Letters · doi:10.1002/lapl.201010125 · Cited by 118
Rimbach-Russ, M., & Burkard, G. (2017) · Journal of Physics Condensed Matter · doi:10.1088/1361-648x/aa761f · Cited by 123
“The most well-known application is the Shor algorithm with is able to efficiently factorize integers[29] and thereby subvert the ability to encode”
BackgroundDecompositions of n-qubit Toffoli Gates with Linear Circuit Complexity
He, Y., Luo, M.-X., Zhang, E., Wang, H.-K., & Wang, X. (2017) · International Journal of Theoretical Physics · doi:10.1007/s10773-017-3389-4 · Cited by 133
Metal–ligand covalency enables room temperature molecular qubit candidates
Fataftah, M. S., Krzyaniak, M. D., Vlaisavljevich, B., Wasielewski, M. R., Zadrozny, J. M., & Freedman, D. E. (2019) · Chemical Science · doi:10.1039/c9sc00074g · Cited by 104
Analytical approach to the Bose-polaron problem in one dimension
Volosniev, A. G., & Hammer, H. ‐. (2017) · Physical Review A · doi:10.1103/physreva.96.031601 · Cited by 93
Minimal physicalism as a scale-free substrate for cognition and consciousness
Fields, C., Glazebrook, J. F., & Levin, M. (2021) · Neuroscience of Consciousness · doi:10.1093/nc/niab013 · Cited by 90
García-Pérez, G., Rossi, M. A. C., Sokolov, B., Tacchino, F., Barkoutsos, P. K., Mazzola, G., Tavernelli, I., & Maniscalco, S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040342 · Cited by 137
Bose–Einstein Condensates in Disordered Potentials
Fallani, L., Fort, C., & Inguscio, M. (2008) · Advances in atomic, molecular, and optical physics · doi:10.1016/s1049-250x(08)00012-8 · Cited by 111
Experimental Investigation of a Two-Qubit Decoherence-Free Subspace
Altepeter, J. B., Hadley, P. G., Wendelken, S. M., Berglund, A. J., & Kwiat, P. G. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.147901 · Cited by 107
Why haven't more quantum algorithms been found?
Shor, P. W. (2003) · Journal of the ACM · doi:10.1145/602382.602408 · Cited by 112
“This class contains the factoring and discrete logarithm algorithms [Shor 1997], Simon s algorithm [Simon 1997] (the .rst member of this class to be discovered), and Hallgren s algorithms for Pell s equation and certain other number theory problems [Hallgren 2002].”
MethodEntangled photon apparatus for the undergraduate laboratory
Dehlinger, D., & Mitchell, M. W. (2002) · American Journal of Physics · doi:10.1119/1.1498859 · Cited by 75
Operator locality in the quantum simulation of fermionic models
Havlíček, V., Troyer, M., & Whitfield, J. D. (2017) · Physical Review A · doi:10.1103/physreva.95.032332 · Cited by 97
One- and two-dimensional ensemble quantum computing in spin Liouville space
Mádi, Z. L., Brüschweiler, R., & Ernst, R. R. (1998) · The Journal of Chemical Physics · doi:10.1063/1.477759 · Cited by 92
Quantum information processing in continuous time
Childs, A. M., & Farhi, E. (2004) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 167
Bose–Hubbard dynamics of polaritons in a chain of circuit quantum electrodynamics cavities
Leib, M., & Hartmann, M. J. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/9/093031 · Cited by 89
A QUBO Model for the Traveling Salesman Problem with Time Windows
Papalitsas, C., Andronikos, T., Giannakis, K., Theocharopoulou, G., & Fanarioti, S. (2019) · Algorithms · doi:10.3390/a12110224 · Cited by 120
Quantum computing for neutrino-nucleus scattering
Roggero, A., Li, A. C. Y., Carlson, J., Gupta, R., & Perdue, G. (2020) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.101.074038 · Cited by 110
Lattice quantum electrodynamics in (3+1)-dimensions at finite density with tensor networks
Magnifico, G., Felser, T., Silvi, P., & Montangero, S. (2021) · Nature Communications · doi:10.1038/s41467-021-23646-3 · Cited by 126
Quantum Simulation of Quantum Field Theories in Trapped Ions
Casanova, J., Lamata, L., Egusquiza, I. L., Gerritsma, R., Roos, C. F., García-Ripoll, J. J., & Solano, E. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.260501 · Cited by 94
Stochastic mechanics according to E. Schrödinger
Zambrini, J.-C. (1986) · Physical Review A · doi:10.1103/physreva.33.1532 · Cited by 110
Dorai, K., Arvind, & Kumar, A. (2000) · Physical Review A · doi:10.1103/physreva.61.042306 · Cited by 98
Adiabatic state preparation study of methylene
Veis, L., & Pittner, J. (2014) · The Journal of Chemical Physics · doi:10.1063/1.4880755 · Cited by 84
Quantum computing: An IBM perspective
Steffen, M., DiVincenzo, D. P., Chow, J. M., Theis, T. N., & Ketchen, M. B. (2011) · IBM Journal of Research and Development · doi:10.1147/jrd.2011.2165678 · Cited by 92
Quantum Supremacy for Simulating a Translation-Invariant Ising Spin Model
Gao, X., Wang, S.-T., & Duan, L.-M. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.040502 · Cited by 93
Quantum Bits with Josephson Junctions
Kockum, A. F., & Nori, F. (2019) · Springer series in materials science · doi:10.1007/978-3-030-20726-7_17 · Cited by 181
Metadata
- Authors
- Feynman, R. P.
- Affiliations
- California Institute of Technology (US)
- Corresponding author
- Feynman, Richard P.
- Venue
- International Journal of Theoretical Physics
- Published
- 1982-06
- Volume
- 21
- Issue
- 6-7
- Pages
- 467-488
- ISSN
- 0020-7748 (ISSN-L)
- 1572-9575
- OpenAlex
- W2179731956
- Cited by
- 7,691
- References
- 9
- Citations by year
- 2026: 301 · 2025: 566 · 2024: 562 · 2023: 513 · 2022: 505 · 2021: 573 · 2020: 452 · 2019: 404 · 2018: 324 · 2017: 323 · 2016: 297 · 2015: 285 · 2014: 287 · 2013: 236 · 2012: 205
- FWCI
- 8.02
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- International Journal of Theoretical Physics (publishedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Keywords
- quantum computing, quantum algorithms, integer factorization, discrete logarithm problem, randomized algorithms, ciphers, computational complexity, quantum vs classical computation
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.