Modified Grover's search algorithm for the cases where the number of solutions is known

Details Modified Grover's search algorithm for the cases where the number of solutions is known Modified Grover's search algorithm for the cases where the number of solutions is known

2005-06-14

arxiv.org/abs/quant-ph/0506105v1

Physics

Quantum Physics

6 pages, No Figure, Latex 2e

Scientific paper

Grover's search algorithm searches a database of $N$ unsorted items in $O(\sqrt{N/M})$ steps where $M$ represents the number of solutions to the search problem. This paper proposes a scheme for searching a database of $N$ unsorted items in $O(logN)$ steps, provided the value of $M$ is known. It is also shown that when $M$ is unknown but if we can estimate an upper bound of possible values of $M$, then an improvement in the time complexity of conventional Grover's algorithm is possible. In that case, the present scheme reduces the time complexity to $O(MlogN)$.

Affiliated with

Also associated with

No associations

Rating

Modified Grover's search algorithm for the cases where the number of solutions is known does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Modified Grover's search algorithm for the cases where the number of solutions is known, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modified Grover's search algorithm for the cases where the number of solutions is known will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-225451