Hosted by Krishna Choudhary and Lester Nare
Written by a model from the transcript; not yet reviewed.
This episode explores the theoretical foundations, history, and algorithmic developments behind quantum computing, setting the stage for a deep dive into modern hardware. The hosts trace the field from John Bell's 1964 formulation of Bell's theorem and the dismantling of local realism, through Landauer's insights on thermodynamic limits and reversible computation, to Richard Feynman's 1981 foundational keynote address on simulating physics. The discussion explains why quantum states cannot be factored like classical bits and how quantum algorithms exploit superposition and interference rather than brute-force parallel search. The hosts walk through the Deutsch-Jozsa and Simon algorithms, leading up to Peter Shor's 1994 factoring algorithm, which upended cryptography and sparked the modern multi-billion dollar race to build fault-tolerant quantum hardware.
The hosts introduce themselves, the episode topic, and set the stage for a deep dive into quantum computing.
Krishna announces his co-authorship on a Nature cover paper and explains the paper’s focus on a silicon quantum processor.
A historical overview from Bell’s theorem to the early 1980s, covering key experiments and figures that shaped quantum theory.
Step‑by‑step walkthrough of the oracle, superposition, and interference that solves the problem in one query.
Wrap‑up of the episode, correction on Riemann hypothesis, and preview of the next part of the deep dive.
Exploration of reversible computing concepts, including Bennett’s work and the Tofoli gate, setting the groundwork for quantum computation.
The origins of quantum money, teleportation, and their implications for secure communication.
Feynman’s 1981 keynote and its impact on reframing quantum mechanics as a computational asset rather than a nuisance.
How Bell’s theorem demonstrates that quantum systems cannot be decomposed into independent parts, enabling computational advantages.
Discussion of the exponential scaling problem when simulating quantum systems on classical computers, motivating quantum hardware.
Hosts recap key points, thank listeners, and preview the next episode’s focus on hardware and algorithms.
Hosts discuss recent breakthroughs, including a cancer vaccine and ancient DNA findings.
Overview of $1.5 billion in foundational research grants and political implications.
Review of Feynman’s keynote, Deutsch’s formalization, and the many‑worlds interpretation.
Hosts map the double‑slit experiment to the Deutsch–Jozsa problem, illustrating constructive/destructive interference.
Explains the role of ancilla qubits and the need for reversible operations before measurement in quantum circuits.
Bell's Theorem and Local Realisminsight
The host explains John Bell's 1964 paper, which proved mathematically that local hidden variables cannot account for quantum mechanics. Later experiments using distant astronomical quasars as filter selectors definitively violated Bell's inequality.
Landauer's Principle of Thermodynamic Costinsight
Rolf Landauer established that information is inherently physical, demonstrating that any logically irreversible operation that destroys information incurs a fundamental thermal energy dissipation cost.
The Ocean Pitch for Quantum Moneystory
Charles Bennett and Gilles Brassard conceived early quantum cryptography and unforgeable quantum money after Bennett swam up to Brassard in the ocean in Puerto Rico while the latter was trying to enjoy his vacation.
Feynman's Exponential Simulation Barrierdata
Richard Feynman noted that because quantum probabilities do not factor, simulating an N-particle quantum system classically scales exponentially, requiring more memory bits than atoms in the universe for just 300 particles.
The Deutsch-Jozsa Toy Problemstrategy
The hosts break down the Deutsch-Jozsa algorithm, showing how a black-box function that is either constant or balanced can be determined in a single quantum shot via interference, compared to exponential classical queries.
Peter Shor Rescues Simon's Paperstory
When an IEEE committee rejected a theoretical quantum period-finding paper by Daniel Simon, Peter Shor advocated for its acceptance, recognizing its underlying algebraic math could solve cryptographic factoring.
“Quantum computing tries every solution in parallel and it finds the right answer.”
“And I mean, like, kinda, but like, honestly, not really.”
“If you want 50 entangled two-state particles, that's 2 to the 50 complex numbers that you have to take care of, right?”
“Nature isn't classical, damn it. And if you wanna take a simulation of nature, you'd better make it quantum mechanical.”
“The idea here is that, and we've talked about some of these stories before previously as well, Neanderthals and Denisovans interbred with modern human ancestors, leaving behind a telltale DNA in our genomes.”
“Every single quantum algorithm uses this idea of constructive and destructive interference to do the computation.”
“The single photon, the wave function goes through both, and it interferes with itself to create, um, single photon interference on my detector, right?”
“The, yeah, that's the crucial thing to realize is the direction of the arrows don't matter.”
“The reason why the Deutsch-Josev algorithm works is because it uses interference.”
“Shor's algorithm came out in the 1990s and the DARPA QIST program established in 2001.”
Quantum computers do not simply “try every answer at once.” So what do they actually do—and why have governments and technology companies spent billions trying to build them? In Part 1 of our two-part quantum computing deep dive, Lester Nare and Krishna Choudhary build the field from first principles. The series was prompted by a new Nature cover paper, A digitally controlled silicon quantum processing unit, co-authored by Krishna and members of the HRL Quantum Team and collaborators. Before getting into that hardware in Part 2, we first need to understand why anyone wanted to build a quantum computer in the first place. We begin with Bell’s theorem and the failure of local hidden-variable explanations of quantum mechanics. From there, we follow the realization that information is fundamentally physical through Rolf Landauer, reversible computation, Charles Bennett, Tommaso Toffoli, Paul Benioff, and the origins of quantum information science. Then Richard Feynman changes the question. Straightforward classical simulation of an interacting quantum system requires tracking a state space that grows exponentially with the number of particles. If nature itself is quantum mechanical, Feynman asks, why not build a computer that is quantum mechanical too? David Deutsch formalizes the universal quantum computer and introduces the first quantum algorithm. Using the Deutsch–Jozsa problem, the double-slit experiment, and Feynman’s path-integral intuition, we explain what a quantum algorithm is actually exploiting: carefully engineered constructive and destructive interference. Finally, we reach the discoveries that turned quantum computing from an academic curiosity into a strategic technology. Daniel Simon develops an early exponential quantum speedup. Peter Shor recognizes how the underlying mathematics can be used to attack problems central to public-key cryptography. Lov Grover follows with a quantum search algorithm—and suddenly governments have a very different reason to care about quantum machines. We also explore quantum money, quantum cryptography, the many-worlds interpretation, Google Willow and parallel-universe headlines, post-quantum security, and what useful quantum computers may ultimately be good for. Part 2: How do you actually build one? Nature paper:A digitally controlled silicon quantum processing unitDOI: 10.1038/s41586-026-10754-7 Link: https://www.nature.com/articles/s41586-026-10754-7 Explore the FFP science funding tracker:ffppod.com/funding Support the show:ffppod.com.com/donate Follow:@FFPPod on X / Instagram / TikTok / Facebook
22,718 words · 3 speakers
Speaker names marked are inferred from speaking time and the show’s known hosts — they are not voice-verified.
Page updated · transcript and summary are machine-generated