Re: Quantum computer : dream or a reality?

From: Mok-Kong Shen (mok-kong.shen_at_t-online.de)
Date: 06/23/04 

Date: Wed, 23 Jun 2004 11:50:16 +0200

Bill Unruh wrote:
[snip]
> There is an algorithm, called the Grover Search algorithm which allows a
> search of 2^L item database in 2^L/2 Quantum operations. Thus this would in
> principle reduce a 128 bit key to an effective length of 64 bits. But 2^64
> bits is still a huge number of operations, and the probability of keeping
> the QC coherent even with error correction through that many operations is
> negligible.

Just my fancy question of ignorance: Could the algorithm be
somehow parallelly or serially applied to some advantage?
Thanks.

M. K. Shen

Relevant Pages

  • Re: Surrogate factoring mysteries resolved
    ... > Now combinations of factors are important, as the proper algorithm ... does the number of divisors increase in a cubic fashion? ... No one doubts that factoring is hard. ...
    (sci.math)
  • Re: Surrogate factoring mysteries resolved
    ... > Now combinations of factors are important, as the proper algorithm ... does the number of divisors increase in a cubic fashion? ... No one doubts that factoring is hard. ...
    (sci.crypt)
  • Re: Bug/Gross InEfficiency in HeathFields fgetline program
    ... But exactly the opposite is true - clarity is lost in *your* version, ... If you think that's a complex algorithm, ... accordance with the Two Rules of Optimisation. ...
    (comp.lang.c)
  • Re: can this code be improved
    ... Why "numberOf" AND "Count"? ... Now we can see what the algorithm is within a few lines of code. ... refactor it further or rewrite it entirely. ...
    (comp.lang.java.programmer)
  • Re: fmincon and simulink
    ... That's okay, users can *snip* out unnecessary sections when they reply. ... This warning just means that FMINCON is going to use a different algorithm ... since the error message indicated that your nonlinear constraint ...
    (comp.soft-sys.matlab)
Quantcast