factual

Proven Quantum Advantage in Query Complexity

In the black-box (query complexity) model, quantum computers have provable advantages over classical ones, including exponential and super-exponential separations; Aaronson and Ambainis proved a problem solvable with a single quantum query that requires about square-root-of-N classical queries, and showed this is the largest possible gap, though query complexity is a 'perturbation-theory' playground rather than a real-world proof.

factualpending

Speaker

Scott Aaronson

Evidence Quote

“In this model of query complexity, here, we really do have proven advantages of quantum computers over classical ones... they can be solved with only one query with a quantum computer”

Source

99 | Scott Aaronson on Complexity, Computation, and Quantum Gravity— Sean Carroll's Mindscape
Created: 6/13/2026, 12:26:25 AM

Your notes

Loading notes...