Comment Re:28 Qubits ought to be enough for everybody (Score 1) 191
Not even for factoring, actually. Factoring is known to be sub-exponential.
yes, you're right. I should have said "outperforms super-polynomially" (I guess it is poly(n) for a QC vs n^log(n) classically, n beinig the input size in bits)
yes, you're right. I should have said "outperforms super-polynomially" (I guess it is poly(n) for a QC vs n^log(n) classically, n beinig the input size in bits)