Re: Quantum Computing

From: Alton Sartor (alto84@yahoo.com)
Date: Mon Jul 26 2004 - 07:55:18 MDT


--- fudley <fuddley@fastmail.fm> wrote:
> 100 quantum entangled electrons can store more than
> one 2^100 number, it
> can store ALL numbers less than or equal to 2^100,
> and thatís a lot.
> This is assuming the electron can only be in two
> quantum states, and you
> might be able to do better than that.
>
> John K Clark
This description comes closest to the truth. Quantum
computers are different then normal computers because
their bits can technically exist in both states at
once. For the computer to work, a group of electrons
must be entangled, a situation where all bits involved
are forced into a superposition (. Once in this
state, logical boolean operators (and, or, not) can be
applied the system without breaking the wave function.
 In addition to the traditional boolean operators, an
additional operator can be used: sqrt(not). Two
sqrt(not) operations in a row yeild the same
functional output as a single not gate. In
conjunction with the other logical operators, it can
be used to solve certain mathamatical problems that
are extremely difficult for computers today. These
problems include factoring large semiprime numbers
(two large prime numbers multiplied together) used in
many encryption schemes and faster algorithms for
searching largs databases.

If you want to know more, I'd recommend
"The Feynman Processor" by G. J. Milburn
http://www.amazon.com/exec/obidos/tg/detail/-/0738201731/002-1390875-8111231?v=glance

and an overview of logical operators
http://computer.howstuffworks.com/boolean.htm

More coming soon...

-Alton

                
_______________________________
Do you Yahoo!?
Express yourself with Y! Messenger! Free. Download now.
http://messenger.yahoo.com



This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:00:48 MDT