Chapter
The Limits and Possibilities of Quantum Computing
1:06:12 - 1:14:40 (08:27)
The number of qubits necessary for a quantum computer to outpace classical computers will need to be sufficient to verify the results, but computational complexity cannot prove definitively that there could not be possibilities for fast classical algorithms for simulating experiments.
Clips
Researchers are working on scaling quantum computers so that classical computers will have a difficult time keeping up, but are also developing statistical tests to verify that the quantum computers are solving hard problems correctly.
1:06:12 - 1:09:07 (02:54)
Summary
Researchers are working on scaling quantum computers so that classical computers will have a difficult time keeping up, but are also developing statistical tests to verify that the quantum computers are solving hard problems correctly.
ChapterThe Limits and Possibilities of Quantum Computing
Episode#72 – Scott Aaronson: Quantum Computing
PodcastLex Fridman Podcast
Theoretical computer science and computational complexity have limitations in terms of what problems they may prove to be hard.
1:09:07 - 1:12:04 (02:56)
Summary
Theoretical computer science and computational complexity have limitations in terms of what problems they may prove to be hard. They may, however, provide evidence or rule out the possibility of fast classical algorithms for specific tasks.
ChapterThe Limits and Possibilities of Quantum Computing
Episode#72 – Scott Aaronson: Quantum Computing
PodcastLex Fridman Podcast
This podcast discusses how quantum computing may be able to efficiently solve a few specific problems and that quantum supremacy is still far from a scalable quantum computer that could threaten public key cryptography.
1:12:04 - 1:14:40 (02:36)
Summary
This podcast discusses how quantum computing may be able to efficiently solve a few specific problems and that quantum supremacy is still far from a scalable quantum computer that could threaten public key cryptography.