[11600] 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 (David Wagner)
Mon Sep 2 16:59:54 2002

X-Envelope-To: cryptography@wasabisystems.com
To: cryptography@wasabisystems.com
From: daw@mozart.cs.berkeley.edu (David Wagner)
Date: 2 Sep 2002 18:35:00 GMT
X-Complaints-To: news@abraham.cs.berkeley.edu

David Honig  wrote:
>At 08:56 PM 8/30/02 -0700, AARG!Anonymous wrote:
>>The problem is that you can't forcibly collapse the state vector into your
>>wished-for eigenstate, the one where the plaintext recognizer returns a 1.
>>Instead, it will collapse into a random state, associated with a random
>>key, and it is overwhelmingly likely that this key is one for which the
>>recognizer returns 0.
>
>I thought the whole point of quantum-computer design is to build
>systems where you *do* impose your arbitrary constraints on the system.

Look again at those quantum texts.  AARG! is absolutely correct.
Quantum doesn't work like the original poster seemed to wish it would;
state vectors collapse into a random state, not into that one magic
needle-in-a-haystack state you wish it could find.

---------------------------------------------------------------------
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