Verifiable Quantum Advantage Without Structure - Quantum Colloquium

Explore a groundbreaking approach to verifiable quantum advantage in this Quantum Colloquium talk by Mark Zhandry from Princeton University. Delve into a new method that challenges the long-standing reliance on "structure" in proposals for super-polynomial quantum advantage, particularly in problems with efficiently verifiable solutions. Learn how this innovative technique eliminates the need for algebraic computational conjectures or oracles with specific features, offering a fresh perspective on quantum computational superiority. Discover the implications of this research, conducted in collaboration with Takashi Yamakawa, and gain insights into the evolving landscape of quantum computing and its potential to surpass classical systems without traditional structural constraints.