Breakthrough in Quantum Computing: Achieving Advantage with Ultra-Deep Noisy Circuits 🧠

Discover how Quynh Nguyen from Harvard demonstrates quantum computational supremacy using polyloglog-depth noisy circuits, pushing the boundaries of quantum algorithm efficiency and fault tolerance.

Breakthrough in Quantum Computing: Achieving Advantage with Ultra-Deep Noisy Circuits 🧠
Simons Institute for the Theory of Computing
209 views β€’ Jun 18, 2025
Breakthrough in Quantum Computing: Achieving Advantage with Ultra-Deep Noisy Circuits 🧠

About this video

Quynh Nguyen (Harvard University)
https://simons.berkeley.edu/talks/quynh-nguyen-harvard-university-2025-05-28
Quantum Algorithms, Complexity, and Fault Tolerance Reunion

In the standard local stochastic noise model, we construct a fully-quantum fault tolerance protocol with polyloglog depth overhead (and polylog-space). Our protocol is fully quantum in the sense that it does not assume noiseless auxiliary classical computation and adaptivity. The main component in our construction is a procedure of incorporating classical fault tolerance to remove these assumptions from a current protocol of Nguyen and Pattison. When applied to constant-depth IQP circuits, this allows us to conclude (under complexity-theoretic assumptions) that sampling from noisy quantum circuits of polyloglog-depth gives a superpolynomial quantum advantage.

Tags and Topics

Browse our collection to discover more content in these categories.

Video Information

Views

209

Likes

3

Duration

36:51

Published

Jun 18, 2025

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.

Trending Now