CoChat

Simulating physics with computers

Feynman, Richard P. · 1982 · International Journal of Theoretical Physics

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

Crossref · 10.1007/bf02650179

Cites

9 of 9 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

14 more claims about this paper

Create a free account to see every claim other papers make about this one.

See all claims — free account

Citations

Cites

Show all 9 references

Cited by

Items 701–800 of 1,097

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.