Quantum Computing since Democritus

by Scott Aaronson

could it be that, for every ε > 0, there exists an algorithm to multiply n-by-n matrices in time O(n2+ε), but as ε approaches zero, these algorithms become more and more complicated without end?