Deterministic Application of Grover's Quantum Search Algorithm

Authors:
Kyoichi Okamoto;Osamu Watanabe
Affiliations:
-;-
Venue:
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Year:
2001

Citing 2
Cited 0

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Quantum Complexity Theory

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Grover's quantum search algorithm finds one of t solutions in N candidates by using (π/4)√N/t basic steps. It is, however, necessary to know the number t of solutions in advance for using the Grover's algorithm directly. On the other hand, Boyer etal proposed a randomized application of Grover's algorithm, which runs, on average, in O(√N/t) basic steps (more precisely, (9/4)√N/t steps) without knowing t in advance. Here we show a simple (almost trivial) deterministic application of Grover's algorithm also works and finds a solution in O(√N/t) basic steps (more precisely, (8π/3)√N/t steps) on average.