IJPAM: Volume 60, No. 1 (2010)

SIMULATION AND THE EXACT COMPLEXITY OF
GROVER'S SEARCH ALGORITHM

Eugen Grycko$^1$, Werner Kirsch$^2$, Tobias Mühlenbruch$^3$
$^{1,2,3}$Department of Mathematics and Computer Science
University of Hagen
125, Lützowstr., Hagen, D-58084, GERMANY
$^1$email: [email protected]
$^2$email: [email protected]
$^3$email: [email protected]


Abstract.We explore a possibility of simulation of Grover's search algorithm on a classical computer. To access the exact (asymptotic) complexity of this algorithm a structural study of the iteration procedure is presented.

Received: February 17, 2010

AMS Subject Classification: 60-04, 68U20

Key Words and Phrases: tensor product, Hilbert space, unitary operator, search space

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2010
Volume: 60
Issue: 1