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

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

Ronak Tiwari, Amir Hossein Moadab, Pavithra Sripathanallur Murali

Published Jan 1, 2024• 0 citations
Publisher

Abstract

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.

DOI
10.1287/ortm.2024.02.05

Related papers

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

Alexis D. Lupo, Olga M. Kosheleva, Владик Крейнович +2 more

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.

River Publishers eBooks•Nov 4, 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: 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

Introduction to Quantum Physics and Quantum Computers

G. Ríos

In the first part of this science lecture we take Richard Feynman famous words about nobody understanding quantum mechanics as a challenge to be overcome a the level of a typical sophomore college students. As a second part we examine the principles of quantum computers and run Shor algorithm as an example.

•Jun 1, 2017•0 citations

AI and Quantum Computing

Eberhard Hechler, Martin Oberhofer, Thomas Schaeck

Richard P. Feynman, a Nobel Prize winner in physics, was a physicist thought leader in the areas of quantum mechanics and quantum electrodynamics. In 1982, he published a research paper with the title “Simulating Physics with Computers”. In this paper, he asks the question if a quantum computer could be built (which he believed to be the case) or if classical computers can simulate the probabilistic behavior of a true quantum system (which he answered with a clear no). This research paper sparked interest in the scientific research community, which started to seriously explore whether or not a quantum computer can actually be built.

Apress eBooks•Jan 1, 2020•1 citation

Quantum computation

Sanjeev Arora, Boaz Barak

Turning to quantum mechanics … secret, secret, close the doors! we always have had a great deal of difficulty in understanding the world view that quantum mechanics represents. … It has not yet become obvious to me that there's no real problem. I cannot define the real problem, therefore I suspect there's no real problem, but I'm not sure there's no real problem. So that's why I like to investigate things.– Richard Feynman, 1964

Cambridge University Press eBooks•Apr 20, 2009•0 citations
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.
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.
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.
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.
Richard P. Feynman, a Nobel Prize winner in physics, was a physicist thought leader in the areas of quantum mechanics and quantum electrodynamics. In 1982, he published a research paper with the title “Simulating Physics with Computers”. In this paper, he asks the question if a quantum computer could be built (which he believed to be the case) or if classical computers can simulate the probabilistic behavior of a true quantum system (which he answered with a clear no). This research paper sparked interest in the scientific research community, which started to seriously explore whether or not a quantum computer can actually be built.