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

River Publishers eBooks

There is Still Plenty of Room at the Bottom: Feynman's Vision of Quantum Computing 65 Years Later

Alexis D. Lupo, Olga M. Kosheleva, Владик Крейнович, Victor L. Timchenko, Yuriy Panteliyovych Kondratenko

Published Nov 4, 2024• 0 citations
Publisher

Abstract

In 1959, Nobelist Richard Feynman gave a talk titled “There’s plenty of room at the bottom”, in which he emphasized that, to drastically speed up computations, we need to make computer components much smaller – all the way to the size of molecules, atoms, and even elementary particles. At this level, physics is no longer described by deterministic Newton’s mechanics, it is described by probabilistic quantum laws. Because of this, computer designers started thinking about how to design a reliable computer based on non-deterministic elements – and this thinking eventually led to the modern ideas and algorithms of quantum computing. So, we have a straight path of speeding up computations: by learning how to use molecules, atoms, and then elementary particles as building blocks of a computational device. But what if we reach the size of an elementary particle? At first glance, it may seem that we will then reach an absolute limit of how fast a computer can be. However, as we show in this paper, we can potentially speed up computations even further – by using the internal structure of elementary particles, e.g., the fact that protons and neutrons consist of quarks. Interestingly, the corresponding mathematics is very similar to what is called color optical computing – the use of light of different colors in computations.

DOI
10.1201/9788770046947-4

Related papers

Quantum Computers and Algorithms: Don’t ask me how, but it works?

Ronak Tiwari, Amir Hossein Moadab, Pavithra Sripathanallur Murali

There’s plenty of room at the bottom was the title of the lecture that Richard Feynman delivered in 1959. His talk at Caltech had more to do with what the future of information storage looked like, and that there was plenty of room available at the atomic level for the same. In the interest of this article however, we take a generalist view on the title of his talk and interpret it as “. . . plenty of room [for exploration] . . . ”. While Feynman was correct and we’ve indeed witnessed the meteoric rise in storage capabilities, the room for exploration has definitely squeezed a bit lately, with the debut of Quantum Computers.

•Jan 1, 2024•0 citations

Rise of the Quantum Machines: Fundamentals

Santanu Ganguly

Los Alamos Laboratory was celebrating its fortieth anniversary on April 14, 1983. Physics Laureate Richard P. Feynman stated in a lecture titled “Tiny Computers Obeying Quantum-Mechanical Laws” that computing based on classical logic could not easily and efficiently process calculations describing quantum phenomena. He offered his vision of computing that could operate in a quantum manner. Prior to making these historical comments, Feynman had always been a champion of thoughts leading toward computers leveraging laws of quantum mechanics when he stated, “There’s plenty of room at the bottom” and, “Nature isn’t classical. If you want to make a simulation of nature, you’d better make it quantum mechanical,” which means to properly simulate quantum systems, you must use a quantum computer.

Apress eBooks•Jan 1, 2021•2 citations

Feynman and Computation

J. J. Hopfield

There were few basic aspects of computers and computation which intrigued Richard P. Feynman, and made the subject sufficiently interesting that he would spend time teaching it. Feynman himself did the lecture on quantum computation. Charles Bennett has already prepared the way by talking about reversible computation, and Norman Margolus on the billiard ball computer, so Feynman developed quantum computation in ways which made its connection to classical reversible computers obvious. His lecture was chiefly developing the idea that an entirely reversible quantum system, without damping processes, could perform universal computation. The insight that quantum computers were really different came only later, and to others, not to Feynman. Feynman only emphasized that the physical scale and speed of computers were not limited by the classical world, since conceptually they could be built of reversible components at the atomic level.

CRC Press eBooks•Nov 16, 2018•64 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

Elementary Structure of Matter can be Studied with New Quantum Computers

Nicolae Petrescu, Florian Ion Tiberiu Petrescu

Much has been talked about quantum computers. Today they are working on difficult simulations, so we can already congratulate the college of researchers at the Oak Ridge National Laboratory as the world's first to successfully simulate an atomic nucleus using a quantum computer. The results that were published in the physical examination letters demonstrate the huge capacity of quantum systems to calculate the problems of nuclear physics and to be able to be successfully used in the future for special and complex simulations. It is already known that quantum calculus, which is based on the quantum principles of matter and which was proposed by American physicist Richard Feynman in the early 1980s, unlike the ordinary bits of normal computers today, uses the qubit units used by quantum computers to store information in two-state systems, such as electrons or photons, considered simultaneously in all possible quantum states (essentially a phenomenon known as overlapping). In October 2017, a multidisciplinary ORNL team began working on codes to perform various simulations on quantum computers such as IBM QX5 and Righetti 19Q within a DOE Quantum Testbed Pathfinder project in an effort to verify and validate various scientific applications on different types of quantum hardware. Today, quantum computers have potential applications in cryptography, artificial intelligence and weather forecasting, as each additional qubit clings in some way inextricably from the others, thus exponentially increasing the number of possible results for the final measured state. Obviously, this huge benefit also has negative effects on the system, because errors can in turn exponentially increase the size of the problem and the final results even. However, it is hoped that in the future on the basis of much-improved hardware, researchers will be able to solve problems that cannot be solved today using current calculation methods. In the present paper the authors propose an original method of rapid theoretical determination with great precision of the dimensions of all elementary particles, the method which, although predicting results similar to those obtained by other theoreticians, still has the advantage of its simplicity, of its general applicability, that is of its universality and especially this new method is a precious tool in the work of scientists worldwide to understand matter at its elementary level. Even though we would have expected that the size of a deuteron would be larger (double) than that of one component particle (of a proton or neutron), at the same velocity, the theory (20-21) demonstrates the opposite. By fusing two free nucleons, a proton and a neutron, a deuterium nucleus is obtained with smaller dimensions than its two components, which makes the energy of rejection between two Deuteron cores much larger than we would have waited. That's why the fusion reaction between two Deuterons is even more difficult than was suspected, even when they are accelerating.

American Journal of Engineering and Applied Sciences•Feb 1, 2018•13 citations

Quantum computing 40 years later

John P. Preskill

Forty years ago, Richard Feynman proposed harnessing quantum physics to build a more powerful kind of computer. Realizing Feynman's vision is one of the grand challenges facing 21st century science and technology. In this article, we'll recall Feynman's contribution that launched the quest for a quantum computer, and assess where the field stands 40 years later.

arXiv:2106.10522•Jun 19, 2021•169 citations
In 1959, Nobelist Richard Feynman gave a talk titled “There’s plenty of room at the bottom”, in which he emphasized that, to drastically speed up computations, we need to make computer components much smaller – all the way to the size of molecules, atoms, and even elementary particles. At this level, physics is no longer described by deterministic Newton’s mechanics, it is described by probabilistic quantum laws. Because of this, computer designers started thinking about how to design a reliable computer based on non-deterministic elements – and this thinking eventually led to the modern ideas and algorithms of quantum computing. So, we have a straight path of speeding up computations: by learning how to use molecules, atoms, and then elementary particles as building blocks of a computational device. But what if we reach the size of an elementary particle? At first glance, it may seem that we will then reach an absolute limit of how fast a computer can be. However, as we show in this paper, we can potentially speed up computations even further – by using the internal structure of elementary particles, e.g., the fact that protons and neutrons consist of quarks. Interestingly, the corresponding mathematics is very similar to what is called color optical computing – the use of light of different colors in computations.
There’s plenty of room at the bottom was the title of the lecture that Richard Feynman delivered in 1959. His talk at Caltech had more to do with what the future of information storage looked like, and that there was plenty of room available at the atomic level for the same. In the interest of this article however, we take a generalist view on the title of his talk and interpret it as “. . . plenty of room [for exploration] . . . ”. While Feynman was correct and we’ve indeed witnessed the meteoric rise in storage capabilities, the room for exploration has definitely squeezed a bit lately, with the debut of Quantum Computers.
Los Alamos Laboratory was celebrating its fortieth anniversary on April 14, 1983. Physics Laureate Richard P. Feynman stated in a lecture titled “Tiny Computers Obeying Quantum-Mechanical Laws” that computing based on classical logic could not easily and efficiently process calculations describing quantum phenomena. He offered his vision of computing that could operate in a quantum manner. Prior to making these historical comments, Feynman had always been a champion of thoughts leading toward computers leveraging laws of quantum mechanics when he stated, “There’s plenty of room at the bottom” and, “Nature isn’t classical. If you want to make a simulation of nature, you’d better make it quantum mechanical,” which means to properly simulate quantum systems, you must use a quantum computer.
There were few basic aspects of computers and computation which intrigued Richard P. Feynman, and made the subject sufficiently interesting that he would spend time teaching it. Feynman himself did the lecture on quantum computation. Charles Bennett has already prepared the way by talking about reversible computation, and Norman Margolus on the billiard ball computer, so Feynman developed quantum computation in ways which made its connection to classical reversible computers obvious. His lecture was chiefly developing the idea that an entirely reversible quantum system, without damping processes, could perform universal computation. The insight that quantum computers were really different came only later, and to others, not to Feynman. Feynman only emphasized that the physical scale and speed of computers were not limited by the classical world, since conceptually they could be built of reversible components at the atomic level.
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.
Much has been talked about quantum computers. Today they are working on difficult simulations, so we can already congratulate the college of researchers at the Oak Ridge National Laboratory as the world's first to successfully simulate an atomic nucleus using a quantum computer. The results that were published in the physical examination letters demonstrate the huge capacity of quantum systems to calculate the problems of nuclear physics and to be able to be successfully used in the future for special and complex simulations. It is already known that quantum calculus, which is based on the quantum principles of matter and which was proposed by American physicist Richard Feynman in the early 1980s, unlike the ordinary bits of normal computers today, uses the qubit units used by quantum computers to store information in two-state systems, such as electrons or photons, considered simultaneously in all possible quantum states (essentially a phenomenon known as overlapping). In October 2017, a multidisciplinary ORNL team began working on codes to perform various simulations on quantum computers such as IBM QX5 and Righetti 19Q within a DOE Quantum Testbed Pathfinder project in an effort to verify and validate various scientific applications on different types of quantum hardware. Today, quantum computers have potential applications in cryptography, artificial intelligence and weather forecasting, as each additional qubit clings in some way inextricably from the others, thus exponentially increasing the number of possible results for the final measured state. Obviously, this huge benefit also has negative effects on the system, because errors can in turn exponentially increase the size of the problem and the final results even. However, it is hoped that in the future on the basis of much-improved hardware, researchers will be able to solve problems that cannot be solved today using current calculation methods. In the present paper the authors propose an original method of rapid theoretical determination with great precision of the dimensions of all elementary particles, the method which, although predicting results similar to those obtained by other theoreticians, still has the advantage of its simplicity, of its general applicability, that is of its universality and especially this new method is a precious tool in the work of scientists worldwide to understand matter at its elementary level. Even though we would have expected that the size of a deuteron would be larger (double) than that of one component particle (of a proton or neutron), at the same velocity, the theory (20-21) demonstrates the opposite. By fusing two free nucleons, a proton and a neutron, a deuterium nucleus is obtained with smaller dimensions than its two components, which makes the energy of rejection between two Deuteron cores much larger than we would have waited. That's why the fusion reaction between two Deuterons is even more difficult than was suspected, even when they are accelerating.