[cryptography] Grover's Algo Beaten?

Jeffrey Goldberg Jeffrey at goldmark.org
Sun Jul 28 02:48:38 EDT 2013

On Jul 27, 2013, at 9:29 PM, Russell Leidich <pkejjy at gmail.com> wrote:

> Is this to be taken seriously...
> Massachusetts Institute of Technology professor Seth Lloyd claims to have developed a quantum search algo which can search 2^N (presumably unsorted) records in O(N) time.

Grover’s original paper included a proof that his result was near a lower bound.

I don’t understand QM well enough (my linear algebra sucks) to have understood the proof sufficiently to see clearly what assumptions it relies on.



More information about the cryptography mailing list