Lex Fridman PodcastScott Aaronson: Quantum Computing | Lex Fridman Podcast #72
At a glance
WHAT IT’S REALLY ABOUT
Scott Aaronson Demystifies Quantum Computing, Supremacy, and Real-World Impact
- Scott Aaronson and Lex Fridman explore why big philosophical questions matter to working scientists and how math and physics make progress by reframing them into tractable sub-questions (“Q‑primes”).
- Aaronson then gives an accessible but technically grounded tour of quantum mechanics as a generalization of probability, introducing amplitudes, interference, qubits, decoherence, and quantum error correction.
- They discuss the current “noisy intermediate-scale quantum” (NISQ) era, Google’s quantum supremacy experiment, what supremacy does and does not prove, and why breaking today’s cryptography is still far off.
- The conversation closes on realistic applications (especially quantum simulation for chemistry and materials), common hype and charlatanism in the field, and Aaronson’s personal views on meaning, purpose, and scientific progress.
IDEAS WORTH REMEMBERING
5 ideasUse ‘Q‑prime’ questions to make philosophical riddles scientifically tractable.
Aaronson argues that progress on big questions (free will, consciousness, machine intelligence) usually comes from carving off precise, answerable sub-questions—like how well physical laws allow us to predict human behavior—rather than attacking the metaphysical question head-on.
Quantum mechanics is best viewed as modified probability with complex amplitudes.
Instead of just nonnegative probabilities, quantum states assign complex amplitudes to possibilities; when these amplitudes evolve and interfere (constructively or destructively), we get counterintuitive phenomena like the double-slit experiment and the power behind quantum computation.
The power of quantum computing comes from choreographing interference, not ‘trying all answers in parallel.’
A quantum computer can put exponentially many potential answers into superposition, but naïve measurement yields only a random one; useful algorithms carefully arrange interference so that wrong answers cancel out while right answers’ amplitudes reinforce.
Decoherence is the central engineering obstacle to scalable quantum computers.
Any unwanted interaction with the environment effectively ‘measures’ qubits and destroys superposition, so practical quantum hardware must balance isolating qubits from the universe while still controlling and coupling them precisely.
Quantum error correction enables reliability from unreliable qubits, but at huge overhead.
Theory shows that if physical error rates are below a threshold, logical qubits can be encoded across many physical qubits to suppress errors; however, current schemes would require millions of high-fidelity physical qubits to do tasks like breaking RSA, far beyond today’s 50‑ish‑qubit devices.
WORDS WORTH SAVING
5 quotesThe entire trick with quantum computing is that you try to choreograph a pattern of interference of amplitudes.
— Scott Aaronson
Anything that quantum computers can do can also be done by classical computers, albeit exponentially slower in some cases.
— Scott Aaronson
Quantum supremacy is already enough by itself to refute the skeptics who said a quantum computer will never outperform a classical computer for anything.
— Scott Aaronson
We know how to do in theoretical computer science... we don’t know how to prove that most of the problems we care about are hard, but we know how to pass the blame to someone else.
— Scott Aaronson
Again and again, I’ve undergone the humbling experience of first lamenting how badly something sucks, then only much later having the crucial insight that its not sucking wouldn’t have been a Nash equilibrium.
— Scott Aaronson, as quoted by Lex Fridman
High quality AI-generated summary created from speaker-labeled transcript.
Get more out of YouTube videos.
High quality summaries for YouTube videos. Accurate transcripts to search & find moments. Powered by ChatGPT & Claude AI.
Add to Chrome