Post #4134472
2026-07-27 08:53 UTC
@FishFace@ioc.exchange It turns out the only reason the “quantum” computing research community thinks Grover’s algorithm is too slow to use in practice is they believe if they sample the register before (pi/4)sqrt(N) time has passed they will cause a “wave collapse.” But there is no such thing.
You can sample the register whenever you want, and look for indications it has converged on an answer.
Grover’s algorithm is actually extremely fast. Lightning fast.
Replies (1)
-
@chemoelectric@masto.ai 2026-07-27 08:56
@FishFace@ioc.exchange Shor’s algorithm, on the other hand, is impossible to implement at scale in ordinary hardware. Thus it cannot break RSA on an ordinary computer, either hybrid or digital. Therefore I am looking for other methods of factorization based on maxent.