[11607] in cryptography@c2.net mail archive

home help back first fref pref prev next nref lref last post

Re: Quantum computers inch closer?

daemon@ATHENA.MIT.EDU (Jaap-Henk Hoepman)
Tue Sep 3 10:38:51 2002

To: cryptography@wasabisystems.com
In-Reply-To: <al0uvq$ccl$1@abraham.cs.berkeley.edu>
From: Jaap-Henk Hoepman <jhh@cs.kun.nl>
Date: 03 Sep 2002 10:10:32 +0200

On 3 Sep 2002 00:15:54 GMT daw@mozart.cs.berkeley.edu (David Wagner) writes:
> And, for the example given by the poster -- exhaustive
> keysearch -- there is no way known to set up a superposition of the
> desired form with O(1) basic quantum operations.  In fact, there is not
> even a shred of reason to believe such a quantum algorithm might exist;
> all available evidence points to the contrary.

But note that there _is_ Grover's search that gives quadratic speedup. 

Jaap-Henk

-- 
Jaap-Henk Hoepman             | Come sail your ships around me
Dept. of Computer Science     | And burn your bridges down
University of Nijmegen        |       Nick Cave - "Ship Song"
Email: jhh@cs.kun.nl         === WWW: www.cs.kun.nl/~jhh
Phone: +31 24 3652713 === Secr: +31 24 3653132 === Fax: +31 24 3653137
PGP ID: F280B29C | Print: C798 7420 F6A3 0B3D 1A0B BC53 1F12 C84E F280 B29C 


---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com

home help back first fref pref prev next nref lref last post