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
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
“to be hard for classical computers, but for which quantum algorithmshavebeendiscoveredthatcouldsolvetheseproblemseasily. Thebestknown exampleistheproblemoffindingtheprimefactorsofalargecompositeinteger[1]. Webelievefactoringishardbecausemanysmartpeoplehavetriedformanydecades to find better factoring algorithms and haven…”
BackgroundAlgorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
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
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Non-Abelian anyons and topological quantum computation
Nayak, C., Simon, S. H., Stern, A., Freedman, M., & Das Sarma, S. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1083 · Cited by 6,861
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
Georgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932
Path integrals in the theory of condensed helium
Ceperley, D. M. (1995) · Reviews of Modern Physics · doi:10.1103/revmodphys.67.279 · Cited by 2,470
Quantum computational advantage using photons
Zhong, H.-S., Wang, H., Deng, Y.-H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Qin, J., Wu, D., Ding, X., Hu, Y., et al. (2020) · Science · doi:10.1126/science.abe8770 · Cited by 2,405
Computational Complexity: A Modern Approach
Arora, S., & Barak, B. (2009) · Cited by 2,359
Quantum simulations with ultracold quantum gases
Bloch, I., Dalibard, J., & Nascimbène, S. (2012) · Nature Physics · doi:10.1038/nphys2259 · Cited by 2,339
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
The theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Engineering atomic and molecular nanostructures at surfaces
Barth, J. V., Costantini, G., & Kern, K. (2005) · Nature · doi:10.1038/nature04166 · Cited by 2,145
QuTiP: An open-source Python framework for the dynamics of open quantum systems
Johansson, J. R., Nation, P. D., & Nori, F. (2012) · Computer Physics Communications · doi:10.1016/j.cpc.2012.02.021 · Cited by 2,123
A quantum engineer's guide to superconducting qubits
Krantz, P., Kjaergaard, M., Yan, F., Orlando, T. P., Gustavsson, S., & Oliver, W. D. (2019) · Applied Physics Reviews · doi:10.1063/1.5089550 · Cited by 2,004
Colloquium : Artificial gauge potentials for neutral atoms
Dalibard, J., Gerbier, F., Juzeliūnas, G., & Öhberg, P. (2011) · Reviews of Modern Physics · doi:10.1103/revmodphys.83.1523 · Cited by 2,033
Superconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733
DiVincenzo, D. P. (1995) · Science · doi:10.1126/science.270.5234.255 · Cited by 1,651
Quantum simulations with trapped ions
Blatt, R., & Roos, C. F. (2012) · Nature Physics · doi:10.1038/nphys2252 · Cited by 1,629
Quantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Demonstration of a Fundamental Quantum Logic Gate
Monroe, C., Meekhof, D. M., King, B. E., Itano, W. M., & Wineland, D. J. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.4714 · Cited by 1,586
Quantum computation and quantum-state engineering driven by dissipation
Verstraete, F., Wolf, M. M., & Ignacio Cirac, J. (2009) · Nature Physics · doi:10.1038/nphys1342 · Cited by 1,570
Quantum 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
“Using a similar technique, (Hen, 2014b) presented a quantum adiabatic version of Simon’s exponential-speedup period finding algorithm (Simon, 1997) [a precursor to Shor’s factoring algorithm (Shor, 1997)], again matching the circuit model depth scaling.”
MethodSuperconducting Qubits: Current State of Play
Kjaergaard, M., Schwartz, M. E., Braumüller, J., Krantz, P., Wang, J. I.-J., Gustavsson, S., & Oliver, W. D. (2020) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-031119-050605 · Cited by 1,544
Dicke quantum phase transition with a superfluid gas in an optical cavity
Baumann, K., Guerlin, C., Brennecke, F., & Esslinger, T. (2010) · Nature · doi:10.1038/nature09009 · Cited by 1,530
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525
Bernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
Interfacing single photons and single quantum dots with photonic nanostructures
Lodahl, P., Mahmoodian, S., & Stobbe, S. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.347 · Cited by 1,465
Simulated Quantum Computation of Molecular Energies
Aspuru-Guzik, A., Dutoi, A. D., Love, P. J., & Head-Gordon, M. (2005) · Science · doi:10.1126/science.1113479 · Cited by 1,418
Steane, A. (1998) · Reports on Progress in Physics · doi:10.1088/0034-4885/61/2/002 · Cited by 1,391
“Richard Feynman, in 1982, was the rst to consider the case of quantum mechanics [16].”
Steane, A. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9708022 · Cited by 1,390
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
Cold and ultracold molecules: science, technology and applications
Carr, L. D., DeMille, D., Krems, R. V., & Ye, J. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/5/055049 · Cited by 1,330
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
Microwave photonics with superconducting quantum circuits
Gu, X., Kockum, A. F., Miranowicz, A., Liu, Y.-X., & Nori, F. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.10.002 · Cited by 1,307
Multiple-particle interference and quantum error correction
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0136 · Cited by 1,284
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Many-body physics with individually controlled Rydberg atoms
Browaeys, A., & Lahaye, T. (2020) · Nature Physics · doi:10.1038/s41567-019-0733-z · Cited by 1,166
Light-induced gauge fields for ultracold atoms
Goldman, N., Juzeliūnas, G., Öhberg, P., & Spielman, I. B. (2014) · Reports on Progress in Physics · doi:10.1088/0034-4885/77/12/126401 · Cited by 1,212
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
“One is encoded into the [[7, 1, 3]] code44 (a code that encodes 1 qubit in7 qubits with minimum distance 3, which implies that it can correct any(3 − 1)/2 = 1 qubit error or detect any (3 − 1) = 2 qubit errors).”
BackgroundMethodInfluentialSuperconducting Qubits: Current State of PlayPreprint
Kjærgaard, M., Schwartz, M. E., Braumüller, J., Krantz, P., Wang, J. I.-J., Gustavsson, S., & Oliver, W. D. (2020) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1,192
Majorana zero modes and topological quantum computation
Sarma, S. D., Freedman, M., & Nayak, C. (2015) · npj Quantum Information · doi:10.1038/npjqi.2015.1 · Cited by 1,180
Entangled states of trapped atomic ions
Blatt, R., & Wineland, D. (2008) · Nature · doi:10.1038/nature07125 · Cited by 1,188
Quantum computing with trapped ions
HAFFNER, H., ROOS, C., & BLATT, R. (2008) · Physics Reports · doi:10.1016/j.physrep.2008.09.003 · Cited by 1,154
Measuring entanglement entropy in a quantum many-body system
Islam, R., Ma, R., Preiss, P. M., Eric Tai, M., Lukin, A., Rispoli, M., & Greiner, M. (2015) · Nature · doi:10.1038/nature15750 · Cited by 1,158
“This scheme is proposed in [2] and made explicit for measurements with beamsplitter operations in optical lattices in [3] and [4], giving Rényi entropy of arbitrary order n.”
BackgroundMethodWilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
Machine learning & artificial intelligence in the quantum domain: a review of recent progress
Dunjko, V., & Briegel, H. J. (2018) · Reports on Progress in Physics · doi:10.1088/1361-6633/aab406 · Cited by 1,055
Ultimate physical limits to computation
Lloyd, S. (2000) · Nature · doi:10.1038/35023282 · Cited by 1,120
Suppressing quantum errors by scaling a surface code logical qubit
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., et al. (2023) · Nature · doi:10.1038/s41586-022-05434-1 · Cited by 1,103
“Since Feynman’s proposal to compute using quantum mechanics [3], many potential applications have emerged, including factoring [4], optimization [5], machine learning [6], quantum simulation [7], and quantum chemistry [8].”
An open-system quantum simulator with trapped ions
Barreiro, J. T., Müller, M., Schindler, P., Nigg, D., Monz, T., Chwalla, M., Hennrich, M., Roos, C. F., Zoller, P., & Blatt, R. (2011) · Nature · doi:10.1038/nature09801 · Cited by 1,100
Observation of a many-body dynamical phase transition with a 53-qubit quantum simulator
Zhang, J., Pagano, G., Hess, P. W., Kyprianidis, A., Becker, P., Kaplan, H., Gorshkov, A. V., Gong, Z.-X., & Monroe, C. (2017) · Nature · doi:10.1038/nature24654 · Cited by 1,079
Quantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071
“One of the (cid:12)rst applications of quantum computers discovered was Shor’s algorithm for integer factorisation [89].”
On-chip quantum simulation with superconducting circuits
Houck, A. A., Türeci, H. E., & Koch, J. (2012) · Nature Physics · doi:10.1038/nphys2251 · Cited by 1,069
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
Randomized benchmarking of quantum gates
Knill, E., Leibfried, D., Reichle, R., Britton, J., Blakestad, R. B., Jost, J. D., Langer, C., Ozeri, R., Seidelin, S., & Wineland, D. J. (2008) · Physical Review A · doi:10.1103/physreva.77.012307 · Cited by 1,019
Quantum information processing with superconducting circuits: a review
Wendin, G. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7e1a · Cited by 890
“There, outside P (P ⊂ BQP), we find problems like Shor’s algorithm [3] where a QTM pro vides exponential speedup.”
BackgroundMethodConditional Quantum Dynamics and Logic Gates
Barenco, A., Deutsch, D., Ekert, A., & Jozsa, R. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4083 · Cited by 971
Aspuru-Guzik, A., & Walther, P. (2012) · Nature Physics · doi:10.1038/nphys2253 · Cited by 952
Britton, J. W., Sawyer, B. C., Keith, A. C., Wang, C.-C. J., Freericks, J. K., Uys, H., Biercuk, M. J., & Bollinger, J. J. (2012) · Nature · doi:10.1038/nature10981 · Cited by 941
Quantum walks: a comprehensive review
Venegas-Andraca, S. E. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0432-5 · Cited by 934
Plasma etching: Yesterday, today, and tomorrow
Donnelly, V. M., & Kornblit, A. (2013) · Journal of Vacuum Science & Technology A: Vacuum, Surfaces, and Films · doi:10.1116/1.4819316 · Cited by 880
Goals and opportunities in quantum simulation
Cirac, J. I., & Zoller, P. (2012) · Nature Physics · doi:10.1038/nphys2275 · Cited by 891
Buluta, I., & Nori, F. (2009) · Science · doi:10.1126/science.1177838 · Cited by 876
The computational complexity of linear optics
Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993682 · Cited by 874
“, we simply choose ε≪δ/p(n), where p(n) is an upper bound on the number of queries to Omade by M, and δis the desired failure probability of M. For BosonFP ⊆FBQP, we use an old observation of Feynman [22] and Abrams and Lloyd [6]: that fermionic and bosonic systems can be simulated efficiently on a standard quantum comp…”
Effective Quantum Spin Systems with Trapped Ions
Porras, D., & Cirac, J. I. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.207901 · Cited by 872
Error mitigation extends the computational reach of a noisy quantum processor
Kandala, A., Temme, K., Córcoles, A. D., Mezzacapo, A., Chow, J. M., & Gambetta, J. M. (2019) · Nature · doi:10.1038/s41586-019-1040-7 · Cited by 871
Weimer, H., Müller, M., Lesanovsky, I., Zoller, P., & Büchler, H. P. (2010) · Nature Physics · doi:10.1038/nphys1614 · Cited by 867
Quantum Algorithms for Quantum Chemistry and Quantum Materials Science
Bauer, B., Bravyi, S., Motta, M., & Chan, G. K.-L. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00829 · Cited by 848
On the role of entanglement in quantum-computational speed-up
Jozsa, R., & Linden, N. (2003) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2002.1097 · Cited by 839
Electron-spin-resonance transistors for quantum computing in silicon-germanium heterostructures
Vrijen, R., Yablonovitch, E., Wang, K., Jiang, H. W., Balandin, A., Roychowdhury, V., Mor, T., & DiVincenzo, D. (2000) · Physical Review A · doi:10.1103/physreva.62.012306 · Cited by 837
Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors
Abrams, D. S., & Lloyd, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.5162 · Cited by 817
Programmable quantum simulations of spin systems with trapped ions
Monroe, C., Campbell, W. C., Duan, L.-M., Gong, Z.-X., Gorshkov, A. V., Hess, P. W., Islam, R., Kim, K., Linke, N. M., Pagano, G., et al. (2021) · Reviews of Modern Physics · doi:10.1103/revmodphys.93.025001 · Cited by 802
Programmable Quantum Simulations of Spin Systems with Trapped Ions
Monroe, C., Campbell, W. C., Duan, L. M., Gong, Z. X., Gorshkov, A. V., Hess, P., Islam, R., Kim, K., Linke, N., Pagano, G., et al. (2019) · arXiv · doi:10.48550/arxiv.1912.07845 · Cited by 806
Le, P. Q., Dong, F., & Hirota, K. (2011) · Quantum Information Processing · doi:10.1007/s11128-010-0177-y · Cited by 792
Towards quantum chemistry on a quantum computer
Lanyon, B. P., Whitfield, J. D., Gillett, G. G., Goggin, M. E., Almeida, M. P., Kassal, I., Biamonte, J. D., Mohseni, M., Powell, B. J., Barbieri, M., et al. (2010) · Nature Chemistry · doi:10.1038/nchem.483 · Cited by 796
Real-time dynamics of lattice gauge theories with a few-qubit quantum computer
Martinez, E. A., Muschik, C. A., Schindler, P., Nigg, D., Erhard, A., Heyl, M., Hauke, P., Dalmonte, M., Monz, T., Zoller, P., et al. (2016) · Nature · doi:10.1038/nature18318 · Cited by 808
Quantum error correction for beginners
Devitt, S. J., Munro, W. J., & Nemoto, K. (2013) · Reports on Progress in Physics · doi:10.1088/0034-4885/76/7/076001 · Cited by 759
Burkard, G., Ladd, T. D., Pan, A., Nichol, J. M., & Petta, J. R. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.025003 · Cited by 715
Optimal Hamiltonian Simulation by Quantum Signal Processing
Low, G. H., & Chuang, I. L. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.010501 · Cited by 769
Photonic quantum information processing: a review
Flamini, F., Spagnolo, N., & Sciarrino, F. (2019) · Reports on Progress in Physics · doi:10.1088/1361-6633/aad5b2 · Cited by 770
“ngenious strategies to realize tasks thought to be hard with classical approaches. Significantadvancesinthissensesprouted withinonlyafewyearsfromdifferentareasofresearch in cryptography [1], algorithms [2], simulation [3] andcommunication[4],eversinceplacingaquantumbefore the name of each field. This shift of paradigm re…”
BackgroundHybrid quantum systems based on magnonics
Lachance-Quirion, D., Tabuchi, Y., Gloppe, A., Usami, K., & Nakamura, Y. (2019) · Applied Physics Express · doi:10.7567/1882-0786/ab248d · Cited by 752
Stabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753
Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
Abrams, D. S., & Lloyd, S. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.2586 · Cited by 745
Simulating Hamiltonian Dynamics with a Truncated Taylor Series
Berry, D. W., Childs, A. M., Cleve, R., Kothari, R., & Somma, R. D. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.090502 · Cited by 742
AI for next generation computing: Emerging trends and future directions
Gill, S. S., Xu, M., Ottaviani, C., Patros, P., Bahsoon, R., Shaghaghi, A., Golec, M., Stankovski, V., Wu, H., Abraham, A., et al. (2022) · Internet of Things · doi:10.1016/j.iot.2022.100514 · Cited by 686
NEQR: a novel enhanced quantum representation of digital images
Zhang, Y., Lu, K., Gao, Y., & Wang, M. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0567-z · Cited by 724
Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz
Romero, J., Babbush, R., McClean, J. R., Hempel, C., Love, P. J., & Aspuru-Guzik, A. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/aad3e4 · Cited by 726
Quantum simulation of the Dirac equation
Gerritsma, R., Kirchmair, G., Zähringer, F., Solano, E., Blatt, R., & Roos, C. F. (2010) · Nature · doi:10.1038/nature08688 · Cited by 725
“In this way, it is possible to simulate quantum systems that can neither be efficiently simulated on a classical computer [15] nor easily accessed experimentally, while allowing parameter tunability over a wide range.”
BackgroundMaterials challenges and opportunities for quantum computing hardware
de Leon, N. P., Itoh, K. M., Kim, D., Mehta, K. K., Northup, T. E., Paik, H., Palmer, B. S., Samarth, N., Sangtawesin, S., & Steuerman, D. W. (2021) · Science · doi:10.1126/science.abb2823 · Cited by 710
Motta, M., Sun, C., Tan, A. T. K., O’Rourke, M. J., Ye, E., Minnich, A. J., Brandão, F. G. S. L., & Chan, G. K.-L. (2020) · Nature Physics · doi:10.1038/s41567-019-0704-4 · Cited by 709
Experimental Implementation of Fast Quantum Searching
Chuang, I. L., Gershenfeld, N., & Kubinec, M. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.3408 · Cited by 707
Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
Berry, D. W., Ahokas, G., Cleve, R., & Sanders, B. C. (2007) · Communications in Mathematical Physics · doi:10.1007/s00220-006-0150-x · Cited by 692
Practical quantum advantage in quantum simulation
Daley, A. J., Bloch, I., Kokail, C., Flannigan, S., Pearson, N., Troyer, M., & Zoller, P. (2022) · Nature · doi:10.1038/s41586-022-04940-6 · Cited by 669
Almost Any Quantum Logic Gate is Universal
Lloyd, S. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.346 · Cited by 690
Efficient Variational Quantum Simulator Incorporating Active Error Minimization
Li, Y., & Benjamin, S. C. (2017) · Physical Review X · doi:10.1103/physrevx.7.021050 · Cited by 686
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.