Speedup of Iterated Quantum Search by Parallel Performance
Yuri Ozhigov
Electronic mail address: y@oz.msk.ru.
Department of Applied Mathematics,
Moscow State University of Technology "Stankin,''
Vadkovsky per. 3a, 101472, Moscow, Russia
Abstract
Given a sequence 
of boolean functions, each 
takes the value 1 at a single point of the form 
, 
. The length of all 
is 
, 
. It is shown how to find 
using 
simultaneous evaluations of functions of the form 
with an error probability of order 
. This is 
times faster than 
sequential applications of the Grover algorithm for quantum search. Evolutions of amplitudes in parallel quantum computations are approximated by systems of linear differential equations. Some advantage of simultaneous evaluations of all 
are discussed.
