We've known since the 90s that there is no exponential quantum advantage for solving non-structured black-box problems. The resolution of the Aaronson–Ambainis conjecture tells us the same result holds even if the algorithms only need to get most inputs correct.
Lance Fortnow
@fortnow
Computational Complexity Theorist
390 Following 7K Followers 6.4K Posts
Latest posts 5
A shout out to everyone at the FOCS conference that starts today in New York City.
focs.computer.org/2026/main-prog…
Enjoy the last major theoretical computer science conference with mostly human-proven theorems.
focs.computer.org/2026/main-prog…
Enjoy the last major theoretical computer science conference with mostly human-proven theorems.
Despite the alarmist title "Quantum Computers Are Poised to Crack Encryption. AI Could Beat Them to It", a rather well-balanced WSJ article.
wsj.com/tech/ai/ai-mat…
wsj.com/tech/ai/ai-mat…
In 1998, John Rogers and I asked whether P = BQP relative to a random oracle (under an assumption like P=PSPACE unrelativized). This new result proving the Aaronson-Ambainis conjecture gets close, implying (BQP in Average-P)^R.
psi.inc/research/aaron…
psi.inc/research/aaron…
Cryptographic assumptions are not that we don't have an efficient algorithm for, say, breaking RSA, but there is no efficient algorithm. The distinction is important because no matter how powerful AI gets, it can't find what isn't there.