Key Moments
Scott Aaronson: Quantum Computing | Lex Fridman Podcast #72
Lex FridmanKey Moments
Scott Aaronson discusses quantum computing, philosophy's role in science, and the challenges of building reliable quantum computers.
Key Insights
Philosophy provides essential background questions for scientific inquiry, even if science offers tools for progress.
Quantum computing leverages quantum mechanics principles like superposition and interference, not just parallel processing.
Decoherence, or unwanted interaction with the environment, is the primary challenge in building quantum computers.
Quantum error correction theory allows for building reliable quantum computers from unreliable parts, though with significant overhead.
Quantum supremacy is a milestone where a quantum computer performs a task faster than any known classical algorithm, not necessarily a useful task.
The most promising near-term application for quantum computing is simulating quantum mechanics for materials science and chemistry, not breaking cryptography.
THE ROLE OF PHILOSOPHY IN SCIENCE
Scott Aaronson emphasizes that philosophy is not a separate domain from science but rather the source of fundamental questions that drive intellectual pursuits. While science provides the tools for making progress and answering specific questions, philosophy frames the "why" behind these inquiries. Historically, figures like Galileo demonstrated that focusing on narrower, technical questions can yield tangible answers, which in turn can reframe our understanding of broader philosophical issues. This interplay suggests that even technical experts benefit from engaging with philosophical concepts, even if professional philosophers approach questions with different methods and linguistic precision.
QUANTUM COMPUTING FUNDAMENTALS AND QUBITS
Quantum computing aims to harness quantum mechanics for computation, departing from classical probability with 'amplitudes' that can be positive, negative, or complex numbers. A key concept is superposition, where a quantum bit, or qubit, can exist in a combination of 0 and 1 states simultaneously. While popular explanations suggest parallel processing, the true power lies in the potential for amplitudes to interfere. This interference is carefully choreographed in quantum algorithms to cancel out wrong answers and reinforce correct ones, a process that is exponentially more complex to describe than classical bits, requiring a vast number of amplitudes for multiple qubits interacting.
THE CHALLENGE OF DECOHERENCE AND NOISY COMPUTERS
The primary obstacle in building quantum computers is decoherence, which is the unwanted interaction of qubits with their environment. Any interaction that leaks information about the qubit's state (0 or 1) causes its quantum state to collapse, akin to a measurement. This necessitates extreme isolation of qubits. However, qubits must also interact precisely to perform computations. Today's quantum computers are 'noisy' due to imperfect isolation and control, making them far from the ideal abstract qubits. This challenges developers to manage these imperfections, as the physical implementation of qubits currently impacts higher-level operations.
QUANTUM ERROR CORRECTION AND THE PATH FORWARD
The theory of quantum error correction offers a solution to decoherence, proposing that reliable quantum computers can be built from unreliable components. By encoding information across multiple qubits and continuously monitoring for leaks, errors can be detected and corrected. This theory has guided quantumcomputing research since the 1990s, setting an engineering agenda focused on building qubits reliable enough for error correction codes to provide a net gain in reliability. While this introduces a significant qubit overhead (potentially millions of physical qubits for one logical qubit) and is not yet fully achieved, it provides a theoretical framework for scalable quantum computation.
QUANTUM SUPREMACY AND ITS IMPLICATIONS
Quantum supremacy, a term coined by John Preskill, signifies the point where a quantum computer can perform a specific, well-defined task significantly faster than any known classical algorithm. This does not necessarily mean the task is useful. The Google demonstration involved a 53-qubit device performing a sampling task, which is exponentially hard for classical computers to simulate. While not requiring full error correction, quantum supremacy proves that quantum computers can outperform classical ones, refuting skeptics. However, verifying these results on classical supercomputers is extremely challenging, pushing research towards new verification methods for larger quantum systems.
APPLICATIONS AND THE POST-QUANTUM LANDSCAPE
While Shor's algorithm for factoring large numbers could break current public-key cryptography, the quantum computers required are far from reality, needing millions of high-quality, error-corrected qubits. In parallel, the field of post-quantum cryptography is developing quantum-resistant algorithms. The most promising near-term application for quantum computing is simulating quantum mechanics itself, enabling advancements in chemical reactions, materials science, and drug discovery, potentially with machines of a few hundred qubits. Other applications, like machine learning, have seen only modest theoretical speed-ups (e.g., Grover's algorithm), and some proposed quantum speed-ups have been 'de-quantized' into classical algorithms.
Mentioned in This Episode
●Products
●Software & Apps
●Companies
●Organizations
●Books
●Concepts
●People Referenced
Common Questions
Philosophical questions, by definition, address the biggest questions, offering fundamental motivations for intellectual pursuits. While science provides tools to make concrete progress on narrower questions, it can also reframe and deepen the understanding of these broader philosophical problems. Scientists often focus on tractable problems, but philosophy keeps the 'why' in the background.
Topics
Mentioned in this video
Professor at UT Austin and director of its quantum information center, known for research in quantum computing and computational complexity theory.
Physicist who coined the term 'noisy intermediate-scale quantum' (NISQ) era.
Founder of AOL, interviewed on bonus episodes of Techmeme Ride Home.
Mathematician and computer scientist who discovered Shor's algorithm, which can efficiently factor huge numbers on a quantum computer.
Scott Aaronson's collaborator at MIT, who, around 2011, realized advantages in using 'sampling problems' for quantum supremacy demonstration.
An undergraduate student who D-quantized a quantum machine learning algorithm proposed by Kerenidis and Prakash, showing a classical algorithm with similar performance.
Pioneering computer scientist known for the Turing Test and his work on computability, who engaged in philosophical debates with Wittgenstein.
Physicist who, along with David Deutsch, discussed the early ideas behind quantum computing in the 1980s.
Pioneer of information theory, known for his 1948 paper that popularized the concept of the 'bit'.
US presidential candidate who tweeted prematurely about quantum computing making all code uncrackable.
Austrian-born British philosopher who debated Alan Turing on formal systems and their relevance to real life.
Researchers who independently came to similar realizations about using sampling problems for quantum supremacy around 2011.
An AI researcher who was interviewed on both Lex Fridman's podcast and Techmeme Ride Home.
Logician famous for his incompleteness theorems, which reframed questions about the limits of mathematical reasoning.
Famed architect in the microprocessor world, known for his work on CPU design and belief in the continued relevance of Moore's Law.
Physicist who, along with Richard Feynman, discussed the early ideas behind quantum computing in the 1980s.
Researchers who proposed an algorithm in 2016 for sampling recommendations exponentially faster than known classical algorithms, later D-quantized.
An app store for Android devices.
A wiki cataloging complexity classes maintained by Scott Aaronson.
A quantum algorithm that can provide a quadratic speedup for search problems and many optimization, AI, and machine learning problems.
A finance app that allows users to send money, buy Bitcoin, and invest in the stock market. It's mentioned as a sponsor for the podcast.
A philosophy journal where Alan Turing published one of his most famous papers.
Home to Summit, one of the largest supercomputers on Earth, capable of performing the classical calculations needed to verify Google's quantum supremacy experiment.
Massachusetts Institute of Technology, where Scott Aaronson was previously a professor.
Securities Investor Protection Corporation, a member of which Cash App Investing is a subsidiary.
Foundational Questions Institute, which hosts conferences attended by Scott Aaronson.
A US agency holding a competition to create standards for post-quantum cryptography.
A company whose research group conducted a study on quantum simulation capabilities with limited qubits.
The parent company of Cash App Investing.
Leading company that announced quantum supremacy with their superconducting quantum computing experiment.
A company actively involved in quantum computing research and development.
A test for artificial intelligence proposed by Alan Turing, evaluating a machine's ability to exhibit intelligent behavior equivalent to, or indistinguishable from, that of a human.
Differential equations used in neuroscience to model the electrical activity of neurons, which have a stochastic component.
A class of public-key cryptosystems considered good candidates for post-quantum cryptography due to their resistance to quantum attacks.
A public-key cryptosystem widely used for secure data transmission, vulnerable to Shor's algorithm on a scalable quantum computer.
The observation that the number of transistors in a dense integrated circuit doubles approximately every two years, expected to hit fundamental limits.
A century-old industrial process for producing ammonia, which is a many-body quantum mechanics problem that could be optimized with quantum simulation.
A field that studies the resources required to solve computational problems, particularly the capabilities and limits of computers.
A major unsolved problem in theoretical computer science, asking whether every problem whose solution can be quickly verified can also be quickly found.
Alan Turing's paper where he started with the question 'Can machines think?' and reframed it as the Turing Test.
An essay by Scott Aaronson suggesting the Q-prime approach to free will by asking how predictably a person's behavior can be.
A novel by Dostoevsky, mentioned by Lex Fridman as a favorite, where he sees himself as the main character for his approach to interviews.
More from Lex Fridman
View all 505 summaries
154 minRick Beato: Greatest Guitarists of All Time, History & Future of Music | Lex Fridman Podcast #492
23 minKhabib vs Lex: Training with Khabib | FULL EXCLUSIVE FOOTAGE
196 minOpenClaw: The Viral AI Agent that Broke the Internet - Peter Steinberger | Lex Fridman Podcast #491
266 minState of AI in 2026: LLMs, Coding, Scaling Laws, China, Agents, GPUs, AGI | Lex Fridman Podcast #490
Found this useful? Build your knowledge library
Get AI-powered summaries of any YouTube video, podcast, or article in seconds. Save them to your personal pods and access them anytime.
Try Summify free