Scott Aaronson
Showing 1–2 of 2 transcripts.
- Dwarkesh Patel1h 27m
Scott Aaronson - Quantum Computing, Complexity, and Creativity
Computer scientist Scott Aaronson recounts his accelerated academic path to a PhD at age 22 and outlines his philosophy on narrowing research focus to master specific computational problems rather than broad fields. He analyzes the historical delays in quantum information science, attributing progress to the confluence of computational complexity theory and Bell's theorem, while discussing the mathematical limits of the Busy Beaver function under Gödel's Incompleteness Theorem. Aaronson further critiques the stagnation of fundamental quantum algorithms since Shor's and Grover's discoveries, argues that economic equilibrium calculations are often computationally intractable, and advises aspiring researchers to leverage pre-print servers to tackle specialized open problems.
- Y Combinator1h 14m
Scott Aaronson on Computational Complexity Theory and Quantum Computers
Scott Aronson clarifies that quantum computing relies on choreographing destructive interference patterns to amplify correct solutions rather than simply testing all possibilities simultaneously, a capability that has shifted the field from theoretical impossibility to a rigorous engineering challenge requiring fault tolerance. He identifies the generation of untrusted random bits as a near-term application for 50–70 qubit devices and introduces shadow tomography, a technique merging differential privacy with quantum mechanics to estimate state properties efficiently. Furthermore, Aronson contextualizes these technical advances within broader computational limits regarding the P vs. NP problem, the holographic nature of spacetime, and the urgent need to align artificial intelligence with human values before addressing existential risks.