[4785] in cryptography@c2.net mail archive
Re: quantum codebreaker
daemon@ATHENA.MIT.EDU (Enzo Michelangeli)
Mon May 24 12:11:45 1999
From: "Enzo Michelangeli" <em@who.net>
To: <coderpunks@toad.com>
Cc: <cryptography@c2.net>
Date: Sat, 22 May 1999 09:22:32 +0800
----- Original Message -----
From: James A. Donald <jamesd@echeque.com>
To: Mike Stay <staym@accessdata.com>; <coderpunks@toad.com>
Cc: <cryptography@c2.net>
Sent: Saturday, May 22, 1999 3:20 AM
Subject: Re: quantum codebreaker
> --
> At 12:26 PM 5/21/99 -0600, Mike Stay wrote:
> > There are actually two papers on the LANL site that say
> > nonlinear quantum computers imply quantum polynomial time
> > solves NP:
>
> We have, however, quite overwhelming reason to believe that
> the Hamiltonian is linear. Indeed, it is difficult to
> conceive of what it would mean for the Hamiltonian to be non
> linear. If the non linearity was sufficient to have
> perceptible effects in everyday life, reality would be
> unimaginably different.
Still, there could be a future for places close to the Galaxy's black holes
as the ultimate, _very_ offshore crypto-computing centers ;-)
In any event, resolution of cryptosystems is generally not an NP-complete
problem, and the paper seems to discuss only the reduction of NP-complete to
P.
Enzo
