Aaronson-Ambainis Conjecture proved! (By AI, of course)
The “For Dummies” Version (apologies for not including this earlier): Yes, an AI solved a big open problem about quantum computing No, this doesn’t kill quantum supremacy, or change how we build quantum computers, or whatever else you read on Twitter What it does, is to rule out a potential class of quantum speedups that most of us didn’t believe would exist anyway (namely, those that would compute a yes-or-no property of exponentially many random bits, superpolynomially faster than any classica...
Read full article →