Robinson's Podcast 269 - Scott Aaronson: What Is Quantum Computing?
35 snips
Feb 1, 2026 
Scott Aaronson, a leading quantum computing theorist and professor at UT Austin, explains quantum basics with clarity. He discusses amplitudes, qubits, interference, and why quantum simulation is the clearest application. He debunks parallel-universes myths, contrasts interpretations of quantum mechanics, and outlines real engineering challenges and timelines for practical quantum machines.
AI Snips
Chapters
Books
Transcript
Episode notes
Early Skeptic Turned Researcher
- Scott Aaronson first encountered quantum computing as a teenager reading about Shor's algorithm and thought the
Quantum Computing Is Linear Algebra
- Quantum computing at the algorithmic level is largely linear algebra and a new rule for probabilities using complex amplitudes.
- You can teach quantum algorithms without the full history of physics by focusing on amplitudes, linear transforms, and measurements.
Amplitudes And Interference Drive Power
- Quantum mechanics replaces ordinary probabilities with complex amplitudes that add and can interfere constructively or destructively.
- Interference lets some outcomes cancel and others amplify, which underlies quantum advantage.
