Show notes
In this episode of the 632nm podcast, Scott Aaronson shares his early fascination with calculus at age 11 and how “rediscovering” old mathematics led him toward groundbreaking work in complexity theory. He gives a lucid explanation of P vs NP, revealing how seemingly trivial questions about verifying solutions speak to some of the deepest unsolved problems in all of computing.Aaronson also explores the frontiers of quantum computing, from the nuances of quantum supremacy experiments to the idea of quantum money and certified randomness. He explains how amplitudes—rather than straightforward probabilities—unlock powerful interference effects, yet still face limits imposed by measurement. The conversation concludes with a look at the future of fault-tolerant quantum computers and the possibility that we’ve finally reached the ultimate horizon of computability—unless nature has even stranger surprises in store.02:01 Early Fascination with Mathematics05:10 Exploring Complexity Theory09:10 Understanding P vs NP22:38 The Significance of P vs NP in Cryptography and AI35:04 Mapping Problems and NP Completeness38:37 Quantum Computing and BQP41:41 Shor's Algorithm and Cryptography45:39 Simulating Quantum Systems52:04 Digital vs Analog Quantum Computers58:18 Grover's Algorithm and Quantum Speedup01:02:04 Challenges in Quantum Algorithm Development01:06:41 Beam Splitter Networks and Quantum Sampling01:15:22 Quantum Computing and Information Storage01:17:24 Shor's Algorithm and Factoring Numbers01:20:56 Google's Quantum Supremacy Demonstration01:49:19 Quantum Money and Unclonable Cash01:57:15 The Future of Quantum ComputingFollow us:Twitter: https://x.com/632nmPodcastSubstack: https://632nmpodcast.substack.com/Michael Dubrovsky: https://x.com/MikeDubrovskyMisha Shalaginov: https://x.com/MYShalaginovXinghui Yin: https://x.com/XinghuiYinSubscribe:Apple Podcasts: https://podcasts.apple.com/us/podcast/632nm/id1751170269Spotify: https://open.spotify.com/show/4aVH9vT5qp5UUUvQ6Uf6ORWebsite: https://www.632nm.com