-----Original Message-----
From: Daniel J. Frasnelli <[EMAIL PROTECTED]>
To: Lenny Foner <[EMAIL PROTECTED]>
Cc: [EMAIL PROTECTED] <[EMAIL PROTECTED]>
Date: Saturday, February 13, 1999 9:45 AM
Subject: Re: Quantum emulation
[...]
> Because the
>current implementation is bottlenecked at physical memory size,
>the largest number I can factor is below 130. I am, however,
>able to factor 111 in 3 minutes, 19 seconds (keep in mind that
>Shor's algorithm assumes exponential complexity)). Not too shabby,
>but I'd love to stick more memory in and see what she can really do.
I think that's quite predictable: don't memory requirements grow
exponentially with the number of bits? I presume that any classical
computing engine can't have any choice other than using physical states
(values in memory) to represent quantum autostates. A simulator is a useful
tool to test and debug quantum algorithms without an actual quantum
platform, but there is no way to mimic the reduction in complexity allowed
by "real" quantum devices.
Enzo
