In today's issue of the journal Science Philip H. Bucksbaum writes that he has
confirmed experimentally that the algorithm L.K. Grover thought of in 1997 for
quantum computers works. It's no longer just theoretical, a quantum computer
really can find a piece of information in a random list of N items in just the square
root of N steps, not 1/2 N steps the average you'd normally expect.
There is more on the web at:
http://www.umich.edu/~newsinfo/Releases/2000/Jan00/r012000b.html
John K Clark jonkc@att.net
begin 666 Quantum memory Physicists show it's not just for theorists anymore.url
M6T1%1D%53%1=#0I"05-%55),/6AT=' Z+R]W=W<N=6UI8V@N961U+WYN97=S
M:6YF;R]296QE87-E<R\R,# P+TIA;C P+W(P,3(P,#!B+FAT;6P-"@T*6TEN
M=&5R;F5T4VAO<G1C=71=#0I54DP]:'1T<#HO+W=W=RYU;6EC:"YE9'4O?FYE
M=W-I;F9O+U)E;&5A<V5S+S(P,# O2F%N,# O<C Q,C P,&(N:'1M; T*36]D
::69I960]-C W,S@W,#$S1#8T0D8P,4)##0H`
`
end
This archive was generated by hypermail 2b29 : Thu Jul 27 2000 - 14:02:27 MDT