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 101–200 of 1,097
Topological quantum computation
Freedman, M., Kitaev, A., Larsen, M., & Wang, Z. (2002) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-02-00964-3 · Cited by 669
Gilyén, A., Su, Y., Low, G. H., & Wiebe, N. (2019) · Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing · doi:10.1145/3313276.3316366 · Cited by 542
“The two most influential quantum algorithms developed later in the ’90s are Shor’s algorithm [51] (based on the quantum Fourier transform) and Grover’s search algorithm [27].”
MethodCai, Z., Babbush, R., Benjamin, S. C., Endo, S., Huggins, W. J., Li, Y., McClean, J. R., & O’Brien, T. E. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045005 · Cited by 591
Quantum-inspired genetic algorithms
Narayanan, A., & Moore, M. (2002) · Proceedings of IEEE International Conference on Evolutionary Computation · doi:10.1109/icec.1996.542334 · Cited by 649
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649
The quantum technologies roadmap: a European community view
Acín, A., Bloch, I., Buhrman, H., Calarco, T., Eichler, C., Eisert, J., Esteve, D., Gisin, N., Glaser, S. J., Jelezko, F., et al. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aad1ea · Cited by 657
2D materials for quantum information science
Liu, X., & Hersam, M. C. (2019) · Nature Reviews Materials · doi:10.1038/s41578-019-0136-x · Cited by 642
A Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646
(2009) · Information Theory · doi:10.1109/9780470544907.ch24 · Cited by 533
Chi-Chih Yao, A. (2002) · Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science · doi:10.1109/sfcs.1993.366852 · Cited by 633
Integer factorization using stochastic magnetic tunnel junctions
Borders, W. A., Pervaiz, A. Z., Fukami, S., Camsari, K. Y., Ohno, H., & Datta, S. (2019) · Nature · doi:10.1038/s41586-019-1557-9 · Cited by 626
Fault-tolerant quantum computation with constant error
Aharonov, D., & Ben-Or, M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258579 · Cited by 631
Shao, Q., Li, P., Liu, L., Yang, H., Fukami, S., Razavi, A., Wu, H., Wang, K., Freimuth, F., Mokrousov, Y., et al. (2021) · IEEE Transactions on Magnetics · doi:10.1109/tmag.2021.3078583 · Cited by 610
Quantum magnonics: When magnon spintronics meets quantum information science
Yuan, H. Y., Cao, Y., Kamra, A., Duine, R. A., & Yan, P. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.03.002 · Cited by 611
Quantum information processing with atoms and photons
Monroe, C. (2002) · Nature · doi:10.1038/416238a · Cited by 627
Moiré heterostructures as a condensed-matter quantum simulator
Kennes, D. M., Claassen, M., Xian, L., Georges, A., Millis, A. J., Hone, J., Dean, C. R., Basov, D. N., Pasupathy, A. N., & Rubio, A. (2021) · Nature Physics · doi:10.1038/s41567-020-01154-3 · Cited by 591
Universal Digital Quantum Simulation with Trapped Ions
Lanyon, B. P., Hempel, C., Nigg, D., Müller, M., Gerritsma, R., Zähringer, F., Schindler, P., Barreiro, J. T., Rambach, M., Kirchmair, G., et al. (2011) · Science · doi:10.1126/science.1208001 · Cited by 613
Simulating a quantum magnet with trapped ions
Friedenauer, A., Schmitz, H., Glueckert, J. T., Porras, D., & Schaetz, T. (2008) · Nature Physics · doi:10.1038/nphys1032 · Cited by 602
Defining and detecting quantum speedup
Rønnow, T. F., Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., & Troyer, M. (2014) · Science · doi:10.1126/science.1252319 · Cited by 601
Quantum Chemistry Calculations on a Trapped-Ion Quantum Simulator
Hempel, C., Maier, C., Romero, J., McClean, J., Monz, T., Shen, H., Jurcevic, P., Lanyon, B. P., Love, P., Babbush, R., et al. (2018) · Physical Review X · doi:10.1103/physrevx.8.031022 · Cited by 446
Topological Quantum Computation
Wang, Z. (2010) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/112 · Cited by 576
Quantum speed limits: from Heisenberg’s uncertainty principle to optimal quantum control
Deffner, S., & Campbell, S. (2017) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8121/aa86c6 · Cited by 585
Is the Moon There When Nobody Looks? Reality and the Quantum Theory
Mermin, N. D. (1985) · Physics Today · doi:10.1063/1.880968 · Cited by 584
Principles of Quantum Mechanics
Baaquie, B. E., & Kwek, L.-C. (2023) · Quantum Computers · doi:10.1007/978-981-19-7517-2_4 · Cited by 553
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
Simulating lattice gauge theories within quantum technologies
Bañuls, M. C., Blatt, R., Catani, J., Celi, A., Cirac, J. I., Dalmonte, M., Fallani, L., Jansen, K., Lewenstein, M., Montangero, S., et al. (2020) · The European Physical Journal D · doi:10.1140/epjd/e2020-100571-8 · Cited by 500
Ising machines as hardware solvers of combinatorial optimization problems
Mohseni, N., McMahon, P. L., & Byrnes, T. (2022) · Nature Reviews Physics · doi:10.1038/s42254-022-00440-8 · Cited by 543
“Deep learning based methods applying reinforcement learning 190,191 , graph neural networks 192–194 , and neural attention mechanism 195 also have been investigated as solvers for combinatorial optimization problems.”
MethodImplementation of a quantum search algorithm on a quantum computer
Jones, J. A., Mosca, M., & Hansen, R. H. (1998) · Nature · doi:10.1038/30687 · Cited by 558
Variational ansatz-based quantum simulation of imaginary time evolution
McArdle, S., Jones, T., Endo, S., Li, Y., Benjamin, S. C., & Yuan, X. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0187-2 · Cited by 557
From quantum cellular automata to quantum lattice gases
Meyer, D. A. (1996) · Journal of Statistical Physics · doi:10.1007/bf02199356 · Cited by 556
Quantum Teleportation Between Distant Matter Qubits
Olmschenk, S., Matsukevich, D. N., Maunz, P., Hayes, D., Duan, L.-M., & Monroe, C. (2009) · Science · doi:10.1126/science.1167209 · Cited by 458
“Theta1 = ArcTan[eigenH[[1,1]]/eigenH[[1,2]]];”
BackgroundToward the first quantum simulation with quantum speedup
Childs, A. M., Maslov, D., Nam, Y., Ross, N. J., & Su, Y. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1801723115 · Cited by 551
Quantum Models of Cognition and Decision
Busemeyer, J. R., Wang, Z., & Pothos, E. (2015) · Oxford Handbooks Online · doi:10.1093/oxfordhb/9780199957996.013.17 · Cited by 534
Quantum spin dynamics and entanglement generation with hundreds of trapped ions
Bohnet, J. G., Sawyer, B. C., Britton, J. W., Wall, M. L., Rey, A. M., Foss-Feig, M., & Bollinger, J. J. (2016) · Science · doi:10.1126/science.aad9958 · Cited by 546
Information 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
“The modular exponentiation in step 3 consumes O(log(2)2N log2 log2N log2 log2 log2N) time (Shor, 1994).”
BackgroundMethodInfluentialTheory of Trotter Error with Commutator Scaling
Childs, A. M., Su, Y., Tran, M. C., Wiebe, N., & Zhu, S. (2021) · Physical Review X · doi:10.1103/physrevx.11.011020 · Cited by 451
(2016) · doi:10.1103/physrevlett.117.060505 · Cited by 540
Quantum walks: a comprehensive reviewPreprint
Venegas-Andraca, S. E. (2012) · Cited by 528
Quantum computing: A taxonomy, systematic review and future directions
Gill, S. S., Kumar, A., Singh, H., Singh, M., Kaur, K., Usman, M., & Buyya, R. (2022) · Software: Practice and Experience · doi:10.1002/spe.3039 · Cited by 476
FAULT-TOLERANT QUANTUM COMPUTATION
PRESKILL, J. (1998) · Introduction to Quantum Computation and Information · doi:10.1142/9789812385253_0008 · Cited by 466
OpenFermion: the electronic structure package for quantum computers
McClean, J. R., Rubin, N. C., Sung, K. J., Kivlichan, I. D., Bonet-Monroig, X., Cao, Y., Dai, C., Fried, E. S., Gidney, C., Gimby, B., et al. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8ebc · Cited by 464
Schlosshauer, M. (2019) · Physics Reports · doi:10.1016/j.physrep.2019.10.001 · Cited by 487
Experimental Verification of Decoherence-Free Subspaces
Kwiat, P. G., Berglund, A. J., Altepeter, J. B., & White, A. G. (2000) · Science · doi:10.1126/science.290.5491.498 · Cited by 519
Quantum Annealing of a Disordered Magnet
Brooke, J., Bitko, D., F., T., Rosenbaum, & Aeppli, G. (1999) · Science · doi:10.1126/science.284.5415.779 · Cited by 518
Artificial intelligence for education: Knowledge and its assessment in AI-enabled learning ecologies
Cope, B., Kalantzis, M., & Searsmith, D. (2021) · Educational Philosophy and Theory · doi:10.1080/00131857.2020.1728732 · Cited by 518
Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states
McClean, J. R., Kimchi-Schwartz, M. E., Carter, J., & de Jong, W. A. (2017) · Physical Review A · doi:10.1103/physreva.95.042308 · Cited by 516
Realizable Universal Quantum Logic Gates
Sleator, T., & Weinfurter, H. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4087 · Cited by 515
The physical nature of information
Landauer, R. (1996) · Physics Letters A · doi:10.1016/0375-9601(96)00453-7 · Cited by 517
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513
“Quantum computation has recently gained a lot of attention, due to oracle results[65, 10, 11] and quantum algorithms[25, 65, 36], in particular Shor’s factorization algorithm [62].”
Quantum Algorithms for Quantum Field Theories
Jordan, S. P., Lee, K. S. M., & Preskill, J. (2012) · Science · doi:10.1126/science.1217069 · Cited by 517
Quantum generative adversarial networks
Dallaire-Demers, P.-L., & Killoran, N. (2018) · Physical Review A · doi:10.1103/physreva.98.012324 · Cited by 506
Complexity as thermodynamic depth
Lloyd, S., & Pagels, H. (1988) · Annals of Physics · doi:10.1016/0003-4916(88)90094-2 · 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 488
Simulating physics with cellular automata
Vichniac, G. Y. (1984) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(84)90253-7 · Cited by 500
The sheaf-theoretic structure of non-locality and contextuality
Abramsky, S., & Brandenburger, A. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/11/113036 · Cited by 419
Nobel Lecture: Superposition, entanglement, and raising Schrödinger’s cat
Wineland, D. J. (2013) · Reviews of Modern Physics · doi:10.1103/revmodphys.85.1103 · Cited by 503
On the power of quantum computation
Simon, D. R. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365701 · Cited by 491
Quantum many‐body phenomena in coupled cavity arrays
Hartmann, M. J., Brandão, F. G. S. L., & Plenio, M. B. (2008) · Laser & Photonics Reviews · doi:10.1002/lpor.200810046 · Cited by 466
Han, K.-H., & Kim, J.-H. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.823467 · Cited by 482
Quantum communication through spin chain dynamics: an introductory overview
Bose, S. (2007) · Contemporary Physics · doi:10.1080/00107510701342313 · Cited by 484
Jerusalem lectures on black holes and quantum information
Harlow, D. (2016) · Reviews of Modern Physics · doi:10.1103/revmodphys.88.015002 · Cited by 480
Quantum simulations of lattice gauge theories using ultracold atoms in optical lattices
Zohar, E., Cirac, J. I., & Reznik, B. (2016) · Reports on Progress in Physics · doi:10.1088/0034-4885/79/1/014401 · Cited by 422
Demonstration of Blind Quantum Computing
Barz, S., Kashefi, E., Broadbent, A., Fitzsimons, J. F., Zeilinger, A., & Walther, P. (2012) · Science · doi:10.1126/science.1214707 · Cited by 475
Chen, M., Menicucci, N. C., & Pfister, O. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.120505 · Cited by 468
Characterizing quantum gates via randomized benchmarking
Magesan, E., Gambetta, J. M., & Emerson, J. (2012) · Physical Review A · doi:10.1103/physreva.85.042311 · Cited by 464
Theory of variational quantum simulation
Yuan, X., Endo, S., Zhao, Q., Li, Y., & Benjamin, S. C. (2019) · Quantum · doi:10.22331/q-2019-10-07-191 · Cited by 458
Digitized adiabatic quantum computing with a superconducting circuit
Barends, R., Shabani, A., Lamata, L., Kelly, J., Mezzacapo, A., Heras, U. L., Babbush, R., Fowler, A. G., Campbell, B., Chen, Y., et al. (2016) · Nature · doi:10.1038/nature17658 · Cited by 463
A blueprint for demonstrating quantum supremacy with superconducting qubits
Neill, C., Roushan, P., Kechedzhi, K., Boixo, S., Isakov, S. V., Smelyanskiy, V., Megrant, A., Chiaro, B., Dunsworth, A., Arya, K., et al. (2018) · Science · doi:10.1126/science.aao4309 · Cited by 458
Quantum circuits with mixed states
Aharonov, D., Kitaev, A., & Nisan, N. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276708 · Cited by 428
Emergence and Frustration of Magnetism with Variable-Range Interactions in a Quantum Simulator
Islam, R., Senko, C., Campbell, W. C., Korenblit, S., Smith, J., Lee, A., Edwards, E. E., Wang, C.-C. J., Freericks, J. K., & Monroe, C. (2013) · Science · doi:10.1126/science.1232296 · Cited by 447
High-Temperature Superfluidity of Fermionic Atoms in Optical Lattices
Hofstetter, W., Cirac, J. I., Zoller, P., Demler, E., & Lukin, M. D. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.220407 · Cited by 448
An introduction to quantum computing for non-physicists
Rieffel, E., & Polak, W. (2000) · ACM Computing Surveys · doi:10.1145/367701.367709 · Cited by 407
“The second half of the October 1997 issue of the SIAM Journal of Computing contains six seminal articles on quantum computing, including four we have already cited [Bennett et al. 1997; Bernstein and Vazirani 1997; Shor 1997; Simon 1997].”
BackgroundMillisecond Coherence Time in a Tunable Molecular Electronic Spin Qubit
Zadrozny, J. M., Niklas, J., Poluektov, O. G., & Freedman, D. E. (2015) · ACS Central Science · doi:10.1021/acscentsci.5b00338 · Cited by 442
Quantum speed limits: from Heisenberg's uncertainty principle to optimal quantum control
Deffner, S., & Campbell, S. (2017) · Maryland Shared Open Access Repository (USMAI Consortium) · doi:10.13016/m2heya-i4ys · Cited by 430
Simulating lattice gauge theories within quantum technologies
Bañuls, M. C., Blatt, R., Catani, J., Celi, A., Cirac, J. I., Dalmonte, M., Fallani, L., Jansen, K., Lewenstein, M., Montangero, S., et al. (2019) · Apollo (University of Cambridge) · doi:10.17863/cam.55853 · Cited by 430
Roadmap of Spin–Orbit TorquesPreprint
Shao, Q., Li, P., Liu, L., Yang, H., Fukami, S., Razavi, A., Wu, H., Wang, K., Freimuth, F., Mokrousov, Y., et al. (2021) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 431
Susskind, L. (2016) · Fortschritte der Physik · doi:10.1002/prop.201500095 · Cited by 427
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
Measuring Out-of-Time-Order Correlators on a Nuclear Magnetic Resonance Quantum Simulator
Li, J., Fan, R., Wang, H., Ye, B., Zeng, B., Zhai, H., Peng, X., & Du, J. (2017) · Physical Review X · doi:10.1103/physrevx.7.031011 · Cited by 403
Measures and dynamics of entangled states
Mintert, F., Carvalho, A. R. R., Kuś, M., & Buchleitner, A. (2005) · Physics Reports · doi:10.1016/j.physrep.2005.04.006 · Cited by 420
Onset of a quantum phase transition with a trapped ion quantum simulator
Islam, R., Edwards, E. E., Kim, K., Korenblit, S., Noh, C., Carmichael, H., Lin, G.-D., Duan, L.-M., Joseph Wang, C.-C., Freericks, J. K., et al. (2011) · Nature Communications · doi:10.1038/ncomms1374 · Cited by 411
Tang, H. L., Shkolnikov, V. O., Barron, G. S., Grimsley, H. R., Mayhall, N. J., Barnes, E., & Economou, S. E. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020310 · Cited by 408
Tang, H. L., Shkolnikov, V. O., Barron, G. S., Grimsley, H. R., Mayhall, N. J., Barnes, E., & Economou, S. E. (2019) · arXiv · doi:10.48550/arxiv.1911.10205 · Cited by 408
Prospects for Spin-Based Quantum Computing in Quantum Dots
Kloeffel, C., & Loss, D. (2013) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-030212-184248 · Cited by 411
Quantum-Gas Microscope for Fermionic Atoms
Cheuk, L. W., Nichols, M. A., Okan, M., Gersdorf, T., Ramasesh, V. V., Bakr, W. S., Lompe, T., & Zwierlein, M. W. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.193001 · Cited by 405
Universal Quantum Computation with Spin-1/2Pairs and Heisenberg Exchange
Levy, J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.147902 · Cited by 404
Chopped random-basis quantum optimization
Caneva, T., Calarco, T., & Montangero, S. (2011) · Physical Review A · doi:10.1103/physreva.84.022326 · Cited by 400
Ultracold quantum gases and lattice systems: quantum simulation of lattice gauge theories
Wiese, U. ‐. (2013) · Annalen der Physik · doi:10.1002/andp.201300104 · Cited by 379
A Race-Track Trapped-Ion Quantum Processor
Moses, S. A., Baldwin, C. H., Allman, M. S., Ancona, R., Ascarrunz, L., Barnes, C., Bartolotta, J., Bjork, B., Blanchard, P., Bohn, M., et al. (2023) · Physical Review X · doi:10.1103/physrevx.13.041052 · Cited by 391
Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer
Jones, J. A., & Mosca, M. (1998) · The Journal of Chemical Physics · doi:10.1063/1.476739 · Cited by 324
Superconducting quantum computing: a review
Huang, H.-L., Wu, D., Fan, D., & Zhu, X. (2020) · Science China Information Sciences · doi:10.1007/s11432-020-2881-9 · Cited by 378
Simulating quantum systems on a quantum computer
Zalka, C. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0162 · Cited by 390
“Most prominently, Peter Shor (1994) has given a ‘quantum algorithm’ for factoring large integers in polynomial time.”
BackgroundMethodInfluentialPolynomial-time quantum algorithm for the simulation of chemical dynamics
Kassal, I., Jordan, S. P., Love, P. J., Mohseni, M., & Aspuru-Guzik, A. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0808245105 · Cited by 385
Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
Babbush, R., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Paler, A., Fowler, A., & Neven, H. (2018) · Physical Review X · doi:10.1103/physrevx.8.041015 · Cited by 383
Quantum-assisted quantum compiling
Khatri, S., LaRose, R., Poremba, A., Cincio, L., Sornborger, A. T., & Coles, P. J. (2019) · Quantum · doi:10.22331/q-2019-05-13-140 · Cited by 382
“Factoring [1], approximate optimization [2], and simulation of quantum systems [3] are some of the applications for which quantum computers have been predicted to provide speedups over classical computers.”
BackgroundUniversal quantum control through deep reinforcement learning
Niu, M. Y., Boixo, S., Smelyanskiy, V. N., & Neven, H. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0141-3 · Cited by 381
Stochastic p -Bits for Invertible Logic
Camsari, K. Y., Faria, R., Sutton, B. M., & Datta, S. (2017) · Physical Review X · doi:10.1103/physrevx.7.031014 · Cited by 360
Probabilistic arithmetic. I. Numerical methods for calculating convolutions and dependency bounds
Williamson, R. C., & Downs, T. (1990) · International Journal of Approximate Reasoning · doi:10.1016/0888-613x(90)90022-t · Cited by 378
Grand Unification of Quantum Algorithms
Martyn, J. M., Rossi, Z. M., Tan, A. K., & Chuang, I. L. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040203 · Cited by 366
Molecular spin qudits for quantum algorithms
Moreno-Pineda, E., Godfrin, C., Balestro, F., Wernsdorfer, W., & Ruben, M. (2018) · Chemical Society Reviews · doi:10.1039/c5cs00933b · Cited by 370
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.