Michele Mosca, lecture entitled "Quantum Computer Algorithms and Interferometry", BRICS Workshop on Algorithms in Quantum Information Processing '98, Aarhus, Jan. 1998.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....0:81 and therefore larger than 1 Gamma 2=5 = 0:6) as claimed in the statement of the Theorem, we could perform a complicated case analysis depending on whether the value x observed in Step 3 is such that F (x) 0 or F (x) 1. Fortunately, in the light of some recent analysis of Michele Mosca [10], which itself is based on results presented in [8] this analysis can be simplified. Since the information obtained by measuring the second register is not used, measuring it in a different basis would not change the behaviour of the algorithm. Measuring in the eigenvector basis of GF , one ....

Mosca, Michele, "Quantum computer algorithms and interferometry", Lecture at BRICS Workshop on Algorithms in Quantum Information Processing, Aarhus, January 1998.

....is simply encoded in the phase 2 by mapping j xi to ( Gamma1) f(x) j xi. In [3] the idea of using the main operator in Grover s algorithm, let us call it G, the Grover iterate, to approximately count is first presented. Further details and related approaches have been discussed subsequently [9, 11]. The randomised approximation schemes suggested in [3, 11, 9] and herein run in time O( 1=ffl log log(N) q N=a) By running time we are referring to the number of calls to the operator U f . We just count the number of calls to U f since the lower bounds associated with these algorithms are ....

....f(x) j xi. In [3] the idea of using the main operator in Grover s algorithm, let us call it G, the Grover iterate, to approximately count is first presented. Further details and related approaches have been discussed subsequently [9, 11] The randomised approximation schemes suggested in [3, 11, 9], and herein run in time O( 1=ffl log log(N) q N=a) By running time we are referring to the number of calls to the operator U f . We just count the number of calls to U f since the lower bounds associated with these algorithms are in terms of these calls. It turns out in fact that for all ....

Michele Mosca, lecture entitled "Quantum Computer Algorithms and Interferometry", BRICS Workshop on Algorithms in Quantum Information Processing '98, Aarhus, Jan. 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC