24/12/2025
Richard Feynman’s fascination with computation in the late 1970s and early 1980s became an unexpected but crucial bridge between his work in fundamental physics and the emergence of 𝘲𝘶𝘢𝘯𝘵𝘶𝘮 𝘤𝘰𝘮𝘱𝘶𝘵𝘪𝘯𝘨. Influenced by new developments in computer science and by conversations with Edward Fredkin, Feynman began to think seriously about computation as a physical process governed by the laws of nature, rather than as an abstract manipulation of symbols.
As microelectronics and theoretical computer science advanced rapidly during this period, Feynman turned his attention to a basic question: how does computation actually work at the physical level? This curiosity led him, in the early 1980s, to present a series of lectures on computation at the 𝘊𝘢𝘭𝘪𝘧𝘰𝘳𝘯𝘪𝘢 𝘐𝘯𝘴𝘵𝘪𝘵𝘶𝘵𝘦 𝘰𝘧 𝘛𝘦𝘤𝘩𝘯𝘰𝘭𝘰𝘨𝘺 (Caltech). These lectures, aimed primarily at physicists, treated computers as physical machines and explored the fundamental limits imposed by physics on information processing. These lectures were later compiled and published as 𝘛𝘩𝘦 𝘍𝘦𝘺𝘯𝘮𝘢𝘯 𝘓𝘦𝘤𝘵𝘶𝘳𝘦𝘴 𝘰𝘯 𝘊𝘰𝘮𝘱𝘶𝘵𝘢𝘵𝘪𝘰𝘯 (1996), a work that vividly reflects his distinctive, physically grounded approach to algorithms and information.
A significant influence on Feynman’s thinking during this period was his interaction with the unconventional physicist and computer scientist Edward Fredkin. Fredkin advocated the provocative idea that the universe itself could be understood as a kind of computer and argued that, because the fundamental laws of physics are reversible in time, computation should be formulated in a reversible manner as well. While Fredkin’s broader philosophical claim that “the universe is a computer” has never gained wide acceptance within the physics community, his technical ideas were original and deeply influential.
Central to Fredkin’s program was the concept of reversible computation. If the laws governing microscopic physics are time-reversible, then, in principle, logical operations should also be reversible and conserve information. This led to the development of reversible logic gates, such as the Fredkin gate, and to computational models in which every step can be run backward without loss of information.
To illustrate these ideas concretely, Fredkin and Tommaso Toffoli formally introduced the billiard-ball computer in the early 1980s. In this idealized model, perfectly elastic balls collide in carefully arranged ways so that their trajectories implement logical operations. Because the collisions are reversible, no information is erased, and the computation mirrors the reversibility found in fundamental physical laws. Feynman found this model particularly illuminating. In his lectures, he used it to show how reversible logic gates could be composed into universal sets and how, in principle, any computation could be realized through appropriately designed physical interactions.
The billiard-ball computer helped prompt a deeper shift in Feynman’s thinking. Rather than imagining macroscopic balls colliding, he began to consider particles interacting according to quantum-mechanical laws. This led him to a profound realization: classical computers are inherently inefficient at simulating quantum systems because nature itself evolves according to quantum mechanics. To efficiently simulate physics, one would need a computer built from quantum systems and governed by the same rules.
From this perspective, computation was no longer an abstract mathematical activity but a physical process, constrained and enabled by the laws of quantum mechanics. It became natural to imagine machines whose elementary operations are unitary, reversible transformations acting on quantum states, and whose classical bits are replaced by quantum bits or qubits capable of existing in superpositions.
What began as reflections on reversible computation and idealized billiard balls thus helped lay the conceptual groundwork for quantum computing. Feynman’s insights were soon formalized and extended by researchers such as Paul Benioff, who developed quantum-mechanical models of computation in the form of quantum Turing machines, and David Deutsch, who introduced the concept of a universal quantum computer. Together with contributions from many others, these ideas launched a new field—one that continues to reshape our understanding of computation, information, and the physical universe.
