About this episode
Has quantum advantage actually been achieved — or is the field still arguing over its own milestones? Dominik Hangleiter, one of the leading theorists working on quantum computational advantage, joins the podcast to make the case that it has, explain why so many physicists remain unconvinced, and map the path toward fault-tolerant, verifiable quantum advantage.Why This Episode MattersIf you follow quantum computing and want to cut through the noise around quantum advantage claims, this episode is for you. Dominik Hangleiter — an Ambizione Fellow at ETH Zürich and postdoctoral fellow at UC Berkeley's Simons Institute — has spent over a decade studying the boundary between what quantum and classical computers can do. His March 2026 paper "Has quantum advantage been achieved?" synthesizes years of experiments, classical simulation attacks, and complexity theory into a clear-eyed assessment. Whether you're an experimentalist, a theorist, or simply quantum-curious, you'll come away with a sharper understanding of what's been demonstrated, what hasn't, and what comes next.What You'll LearnWhy random circuit sampling became the primary arena for proving quantum advantage — and why the task's "uselessness" is a feature, not a bugHow the linear cross-entropy benchmark (XEB) works as a statistical proxy for verifying classically intractable quantum computationWhy audiences of physicists are still split on whether quantum advantage has been demonstrated, despite multiple experiments since 2019What "peaked circuits" are and how they interpolate between random sampling and structured computationHow post-quantum cryptography (learning with errors) exploits problems that quantum computers can't solve — and what that reveals about quantum computation's limitsWhy basic arithmetic is surprisingly hard for fault-tolerant quantum computers, and how that bottlenecks algorithms like Shor'sHow fault-tolerant compilation co-designs quantum circuits with error-correcting codes to make advantage experiments scalableThe difference between "native" quantum operations and the overhead required for universal fault-tolerant computationWhy the interplay between quantum and classical computing strengths — not quantum dominance — may define the field's futureResources & LinksPapers & ArticlesHas quantum advantage been achieved? — Hangleiter's March 2026 paper synthesizing the quantum advantage debateComputational Advantage of Quantum Random Sampling — Hangleiter & Eisert's comprehensive review in Reviews of Modern Physics (2023)Fault-Tolerant Compiling of Classically Hard
