Dwarkesh Podcast

Scott Aaronson - Quantum Computing, Complexity, and Creativity

Scott Aaronson is a Professor of Computer Science at The University of Texas at Austin, and director of its Quantum Information Center. He's the author of one of the most interesting blogs on the internet: https://www.scottaaronson.com/blog/ He was also my professor for a class on quantum computing. Episode Website: https://www.dwarkeshpatel.com/p/scott-aaronson Apple Podcasts: https://apple.co/3AXXrr2 Spotify: https://spoti.fi/3dYUCgc Follow me on Twitter to get updates on future episodes and guests: https://twitter.com/dwarkesh_sp Buy Scott's book on Quantum Computing since Democritus: https://amzn.to/3eanguN Timestamps 0:00 Intro 0:33 Journey through high school and college 12:37 Early work 19:15 Why quantum computing took so long 33:30 Contributions from outside academia 38:18 Busy beaver function 53:50 New quantum algorithms 1:02:24 Clusters 1:06:23 Complexity and economics 1:13:26 Creativity 1:24:07 Advice to young people

Scott AaronsonguestDwarkesh Patelhost

Nov 19, 20201h 27mWatch on YouTube ↗

WHAT IT’S REALLY ABOUT

Scott Aaronson on quantum ideas, genius, busy beaver and creativity limits

Scott Aaronson discusses his accelerated educational path, early specialization in theoretical computer science, and the social tradeoffs that came with it. He explains why key quantum information ideas (teleportation, quantum computing) arrived decades after quantum mechanics, emphasizing shifts in viewpoint, intellectual pre‑requisites, and historical contingencies. The conversation dives into the busy beaver function, Gödel’s incompleteness, and how these shape our understanding of uncomputability and the limits of formal systems. Aaronson also reflects on quantum algorithms, the hardness of finding Nash equilibria, David Deutsch’s views on creativity and universal explanation, and offers practical advice for young people interested in technical fields.

IDEAS WORTH REMEMBERING

5 ideas

Early acceleration can solve academic frustration but amplify social difficulties.

Aaronson left high school early due to boredom and structural constraints, thriving intellectually in college while acknowledging that skipping grades significantly complicated his social and dating life.

Becoming a world expert on a tiny problem is surprisingly achievable.

He advises young people to systematically read current research, pick a very narrow open question, and push until they understand it better than anyone—using that as a stepping stone to broader expertise and collaborations.

Quantum information theory required both new attitudes toward entanglement and mature computer science.

Viewing entanglement as a usable resource (Bell, Wiesner) and the prior development of complexity theory (P vs NP, NP-completeness) were necessary before ideas like quantum teleportation and quantum computing could be “plucked” from quantum mechanics.

The busy beaver function exemplifies concrete, rapidly growing uncomputable behavior.

Defined via halting Turing machines, busy beaver grows faster than any computable function; only the first few values are known, and beyond a certain point their exact values are provably unreachable from standard set-theoretic axioms.

Complexity theory reveals that guaranteed equilibria may still be computationally inaccessible.

While Nash equilibria always exist, finding them is complete for a hard complexity class (not NP-complete but analogous), underscoring that existence theorems in economics do not ensure markets or agents can actually compute those equilibria.

WORDS WORTH SAVING

5 quotes

It really doesn't take that long to become the world expert on one particular tiny little problem.

— Scott Aaronson

By the age of 16 or so, I knew what I was passionate about. It was the fundamentals of computing and understanding what computers could or couldn’t do.

— Scott Aaronson

Quantum mechanics and the theory of computing were both in place by the 1930s, but there was a lot of other stuff on people's plates.

— Scott Aaronson

Busy beaver grows faster than any computable function… you will utterly destroy any opponent who doesn’t know about it in a largest-number contest.

— Scott Aaronson

Let’s not take a useful heuristic and elevate it into a basic principle of reality.

— Scott Aaronson

Aaronson’s accelerated education, early college entry, and social vs. academic tradeoffsBenefits and limits of early specialization and the notion of ‘teenager-hood’Historical development of quantum computing and entanglement as a resourceThe busy beaver function, uncomputability, and Gödel’s incompleteness theoremQuantum algorithms (Shor, Grover), low-hanging fruit, and search for new paradigmsComputational complexity of Nash equilibria and implications for economicsCreativity, human intelligence, and debates with David Deutsch on universal explainers

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.