Re:Proof emerges that a quantum computer can outperform a cl...
by teraflop on Sunday September 29, 2019 @12:09PM
(#21107838)
Grover's algorithm provides a quadratic speedup, but sqrt(n!) is not quadratic time; it's super-exponential.
[ Parent
| on HN ]
There are no comments on this comment yet.