Post #4134473
2026-07-27 08:48 UTC
@FishFace@ioc.exchange I am sorry I have been away for some while but have been working on the various problems.
I have a fully working Grover’s algorithm for AMD Zen 5 here: https://github.com/probabilistic-numerical-algorithms/grover_search/tree/master/Ada-Zen5-IntegerMath
It finds an item in an array of a million, on my mini-PC, in about 3 milliseconds.
In the same repository is an electronics project for building a “quantum” computer with ordinary op amps. I have run the LTSpice simulation and it converges immediately.
Replies (1)
-
@chemoelectric@masto.ai 2026-07-27 08:53
@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.