MilestoneTheory & algorithmsConfirmed
Seth Lloyd proves Feynman's conjecture on simulating quantum systems
Aug 23, 1996
Seth Lloyd of MIT shows that a quantum computer can be programmed to efficiently simulate any quantum system whose parts interact locally, confirming Richard Feynman's conjecture. Lloyd later noted that this class includes the standard model of particle physics.
Why it matters
It put quantum simulation on a solid theoretical footing. John Preskill calls simulating quantum systems the application of quantum computers most likely to have a broad impact on the world.
Seth Lloyd · MIT
Related
Sources (4)
-
Science
Universal Quantum Simulators
“Feynman's 1982 conjecture, that quantum computers can be programmed to simulate any local quantum system, is shown to be correct.”
-
arXiv (Seth Lloyd)
The Universe as Quantum Computer
“In 1996, Lloyd developed a quantum algorithm for implementing such universal quantum simulators [21]. The Feynman-Lloyd results show that, unlike classical computers, quantum computers can simulate efficiently any quantum system that evolves by local interactions, including for example the standard model of elementary particles.”
-
arXiv (Alsing, Cafaro and Mancini)
Feynman's "Simulating Physics with Computers"
“We passed from the level of “conjecture” to the level of “proof” for the universality of quantum simulators [15].”
-
arXiv (John Preskill)
Quantum computing 40 years later
“Feynman’s proposal to use quantum computers to simulate quantum systems is still the application that seems most likely to have a broad impact on the world.”
Each quote above was checked automatically against the original page. Added Oct 15, 2026. Spotted an error? Tell us and we will review it.