Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2405.03366 · International Journal of Theoretical Physics

Feynman’s “Simulating Physics with Computers”

Paul M. Alsing, Carlo Cafaro, Stefano Mancini

Published May 6, 2024• 1 citation
arXivHTMLPDF
DOI
10.1007/s10773-024-05653-4

Related papers

Simulating Physics with Computers

Søren Toxværd

Feynman gave in 1982 a keynote speech \textit{Simulating Physics with Computers} (Int. J. Theor. Phys. {\bf 21}, 467 (1982)) in which he talked ``...about the possibility...that the computer will do exactly the same as nature". The motivation was that: ``...the physical world is quantum mechanical, and therefore the proper problem is the simulation of quantum physics". Here I try after more than forty years to answer Feynman's question of whether it is possible to perform exact computer simulations. Many computer simulations are not exact, they contain mean field approximations that disobey the symmetry in the quantum dynamics with Newton's third law, e.g. almost all astrophysical simulations of galaxy systems. After a review of computer simulations and the problems of simulating real systems, I argue that Newton's discrete dynamics, which is used in almost all computer simulations and which is exact in the same sense as Newton's analytic dynamics, is the classical limit path of Feynman's quantum paths. However, the physical world is not known exactly and it is much more complex than any simulated systems, and so far no real systems have been simulated exactly. Hence, more than forty years later, and after hundreds of thousands of computer simulations of the physical system's dynamics the answer to Feynman's question is still negative. But although it is not possible to simulate the dynamics exactly for any real systems, the simulations have been and will be of great use in Natural Science.

arXiv:2405.20780•May 28, 2024•0 citations

Feynman and computation: Exploring the limits of computers

Computers & Mathematics with Applications•May 1, 2003•7 citations

Feynman and computation: Exploring the limits of computers

Computers & Mathematics with Applications•May 1, 1999•9 citations

Feynman and computation: From Los Alamos to quantum computers

Tony Hey

The last lecture course that Nobel Prize winner Richard Feynman gave to students at Caltech was not on physics but on computer science. The course in 1983 was an overview of standard and not-so-standard topics in computer science, all given in Feynman’s inimitable style. This talk will begin by giving an overview of Feynman’s long-time interest in computing - starting with his time at Los Alamos during the war through to his suggestion of simulating physics on a quantum computer at a ‘Physics of Computation Conference at MIT in 1981 and his acting as a consultant for the parallel computer company, Thinking Machines. The talk will conclude with a summary of Feynman’s long-term interest in the physical limits to computation and the exemplary way he could communicate complex ideas to all types of audience.

The International Journal of High Performance Computing Applications•May 12, 2025•0 citations

The Birth of Quantum Computing

Chris Jay Hoofnagle, Simson Garfinkel

The history of Quantum Computing and Quantum Cryptography starts with a friendship between Charles Bennett and Stephen Wiesner, two undergraduates at Brandeis University who toyed with ideas for sending information using quantum entanglement, and John Conway's Game of Life, which stimulated interest in cellular automata at MIT in the 1970s and started a generation of computer scientists wondering if the universe might be some massive computer running a simulation of reality. In 1974 MIT professor Ed Fredkin spent his yearlong sabbatical at Caltech, where he learned quantum physics from Richard Feynman while he taught Feynman about computer science. Returning to MIT, Fredkin's ideas developed into the philosophy of digital physics, which blossomed into the 1981 Conference on Physics and Computation at MIT. Feynman's keynote at the conference described how a computer based on quantum mechanics principles could compute physics simulations much faster than today's classical compu

Cambridge University Press eBooks•Nov 18, 2021•0 citations

Simulating physics with computers

Richard P. Feynman

International Journal of Theoretical Physics•Jun 1, 1982•7,681 citations
Feynman gave in 1982 a keynote speech \textit{Simulating Physics with Computers} (Int. J. Theor. Phys. {\bf 21}, 467 (1982)) in which he talked ``...about the possibility...that the computer will do exactly the same as nature". The motivation was that: ``...the physical world is quantum mechanical, and therefore the proper problem is the simulation of quantum physics". Here I try after more than forty years to answer Feynman's question of whether it is possible to perform exact computer simulations. Many computer simulations are not exact, they contain mean field approximations that disobey the symmetry in the quantum dynamics with Newton's third law, e.g. almost all astrophysical simulations of galaxy systems. After a review of computer simulations and the problems of simulating real systems, I argue that Newton's discrete dynamics, which is used in almost all computer simulations and which is exact in the same sense as Newton's analytic dynamics, is the classical limit path of Feynman's quantum paths. However, the physical world is not known exactly and it is much more complex than any simulated systems, and so far no real systems have been simulated exactly. Hence, more than forty years later, and after hundreds of thousands of computer simulations of the physical system's dynamics the answer to Feynman's question is still negative. But although it is not possible to simulate the dynamics exactly for any real systems, the simulations have been and will be of great use in Natural Science.
The last lecture course that Nobel Prize winner Richard Feynman gave to students at Caltech was not on physics but on computer science. The course in 1983 was an overview of standard and not-so-standard topics in computer science, all given in Feynman’s inimitable style. This talk will begin by giving an overview of Feynman’s long-time interest in computing - starting with his time at Los Alamos during the war through to his suggestion of simulating physics on a quantum computer at a ‘Physics of Computation Conference at MIT in 1981 and his acting as a consultant for the parallel computer company, Thinking Machines. The talk will conclude with a summary of Feynman’s long-term interest in the physical limits to computation and the exemplary way he could communicate complex ideas to all types of audience.
The history of Quantum Computing and Quantum Cryptography starts with a friendship between Charles Bennett and Stephen Wiesner, two undergraduates at Brandeis University who toyed with ideas for sending information using quantum entanglement, and John Conway's Game of Life, which stimulated interest in cellular automata at MIT in the 1970s and started a generation of computer scientists wondering if the universe might be some massive computer running a simulation of reality. In 1974 MIT professor Ed Fredkin spent his yearlong sabbatical at Caltech, where he learned quantum physics from Richard Feynman while he taught Feynman about computer science. Returning to MIT, Fredkin's ideas developed into the philosophy of digital physics, which blossomed into the 1981 Conference on Physics and Computation at MIT. Feynman's keynote at the conference described how a computer based on quantum mechanics principles could compute physics simulations much faster than today's classical compu