Re: Quantum computers inch closer?

2002-09-03 Thread Jaap-Henk Hoepman
On 3 Sep 2002 00:15:54 GMT [EMAIL PROTECTED] (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

Re: Quantum computers inch closer?

2002-09-03 Thread Ed Gerck
Jaap-Henk Hoepman wrote: On Mon, 02 Sep 2002 17:59:12 -0400 John S. Denker [EMAIL PROTECTED] writes: The same applies even more strongly to quantum computing: It would be nice if you could take a classical circuit, automatically convert it to the corresponding quantum circuit, with

Re: Quantum computers inch closer?

2002-09-02 Thread David Honig
At 08:56 PM 8/30/02 -0700, AARG!Anonymous wrote: Bear writes: In this case you'd need to set up the wires-and-gates model in the QC for two ciphertext blocks, each attached to an identical plaintext-recognizer function and attached to the same key register. Then you set up the entangled

Re: Quantum computers inch closer?

2002-09-02 Thread David Wagner
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,

Re: Quantum computers inch closer?

2002-09-02 Thread John S. Denker
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, Sorry, that's a severe mis-characterization. David Honig wrote: I

Re: Quantum computers inch closer?

2002-09-02 Thread David Wagner
Ed Gerck wrote: The original poster is correct, however, in that a metric function can be defined and used by a QC to calculate the distance between a random state and an eigenstate with some desired properties, and thereby allow the QC to define when that distance is zero -- which provides the

Re: Quantum computers inch closer?

2002-08-31 Thread AARG!Anonymous
Bear writes: In this case you'd need to set up the wires-and-gates model in the QC for two ciphertext blocks, each attached to an identical plaintext-recognizer function and attached to the same key register. Then you set up the entangled state, and collapse the eigenvector on the

Re: Quantum computers inch closer?

2002-08-30 Thread Ed Gerck
bear wrote: On Sat, 17 Aug 2002, Perry E. Metzger wrote: [I don't know what to make of this story. Anyone have information? --Perry] Quantum computer called possible with today's tech http://www.eet.com/story/OEG20020806S0030 .. The papers I've been reading claim that feistel

Quantum computers inch closer?

2002-08-17 Thread Perry E. Metzger
[I don't know what to make of this story. Anyone have information? --Perry] Quantum computer called possible with today's tech http://www.eet.com/story/OEG20020806S0030 MADISON, Wis. Researchers at the University of Wisconsin in Madison claim to have created the world's first successful