[cryptography] Grover's Algo Beaten?

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. (This is the subtext of this mundane article about VC funding for search engines.)

Re: [cryptography] Grover's Algo Beaten?

On Sun, Jul 28, 2013 at 1:29 PM, Russell Leidich pke...@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. (This is the

Re: [cryptography] Grover's Algo Beaten?

On 2013-07-28 1:29 PM, Russell Leidich 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. (This is the subtext of this mundane

Re: [cryptography] Grover's Algo Beaten?

Thanks, Noon. It's good to know that some searches are still hard in the sense of square root as opposed to log of classical. So based on his actual claims in the papers you cited, when the EE Times article says: And he claims the process worked so well that even the largest data set of all --