PSI's research system, running a non-public Anthropic model, found a Lean-checked proof of the 2008 Aaronson-Ambainis conjecture, so quantum query speedups on random inputs are at most polynomial.
pull down to refresh
pull down to refresh
PSI's research system, running a non-public Anthropic model, found a Lean-checked proof of the 2008 Aaronson-Ambainis conjecture, so quantum query speedups on random inputs are at most polynomial.