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
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Simulating physics with computers. https://app.cochat.ai/papers/10.1007/bf02650179
- The paper
- Feynman, R. P. (1982). Simulating physics with computers. International Journal of Theoretical Physics. https://doi.org/10.1007/bf02650179
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.