PASADENA, July 13 — The figure that matters: 1981. That was the year Richard Feynman, a Nobel Prize-winning physicist, stood before a conference at MIT and delivered a lecture titled “Simulating Physics with Computers.” In that talk, he proposed that a quantum computer could efficiently simulate quantum systems. It is widely considered the birth of quantum computing.
The bottom line: Feynman’s lecture laid the intellectual foundation for a field that, decades later, is attracting investment and reshaping how researchers think about computation itself. Investors will note that the timeline from theory to application in quantum computing has been long, but the momentum is now unmistakable.
Feynman was already a giant in physics by 1981. Born in 1918, he won the Nobel Prize in Physics in 1965 for his contributions to quantum electrodynamics. He developed Feynman diagrams, a visual tool for calculating particle interactions that became standard in the field.
He worked on the Manhattan Project during World War II. He spent his later years teaching at Caltech.
By the numbers, his 1981 lecture is the singular event that launched quantum computing as a field. Before Feynman, the idea of a computer that exploited quantum mechanics was not a serious research agenda. After Feynman, it was.
The lecture inspired a generation of researchers. Among them: David Deutsch, who went on to formalize the concept of a universal quantum computer, and Peter Shor, who developed an algorithm for factoring large numbers that demonstrated quantum computers could outperform classical ones on certain tasks. Both have cited Feynman’s 1981 talk as a starting point.
Feynman died in 1988. He did not live to see a working quantum computer, or the companies now racing to build one.
But his vision continues to drive the field.
How the idea works
The core insight Feynman presented was straightforward but radical. Classical computers, he argued, are fundamentally inefficient at simulating quantum systems. The number of variables required to describe even a modest quantum system grows exponentially.
A classical computer quickly runs out of memory and processing power. Feynman’s answer: build a computer that is itself quantum.
Such a machine, he proposed, would naturally map onto quantum problems, making simulation efficient. That idea is the conceptual engine behind every quantum computing effort today.
What to watch next
The field Feynman started is now moving from theory to engineering. Companies and research labs are racing to build machines with enough qubits and low enough error rates to outperform classical computers on practical problems. Investors will note that while no one has yet built a fully fault-tolerant quantum computer, the progress in recent years has been faster than before.
Feynman’s 1981 lecture remains the reference point. Every quantum computing roadmap, every funding round, every milestone announcement traces back to that moment at MIT.
The figure that matters is still the same one.
Sources
{“@context”: “https://schema.org”, “@type”: “NewsArticle”, “headline”: “Nobel Winner Richard Feynman Proposed Quantum Computing in 1981”, “description”: “PASADENA, July 13 — The figure that matters: 1981. That was the year Richard Feynman, a Nobel Prize-winning physicist, stood before a conference at MIT…”, “datePublished”: “2026-07-13T09:30:00+00:00”, “author”: {“@type”: “Person”, “name”: “Ava Anderson”}, “publisher”: {“@type”: “Organization”, “name”: “InfoPulse Today”, “url”: “https://newsfeed.infopulsetoday.com/”}, “citation”: [{“@type”: “CreativeWork”, “url”: “https://en.wikipedia.org/wiki/Richard_Feynman”}]}
