Modified Grover's Search Algorithm in O(M+logN)Steps

Details Modified Grover's Search Algorithm in O(M+logN)Steps Modified Grover's Search Algorithm in O(M+logN)Steps

2005-06-12

arxiv.org/abs/quant-ph/0506093v2

Physics

Quantum Physics

This paper has been withdrawn by the authors due to soem conceptual error

Scientific paper

The present letter proposes a modification in the well known Grover's search algorithm, which searches a database of $N$ unsorted items in $O(\sqrt{N/M})$ steps, where $M$ represents the number of solutions to the search problem. Concurrency control techniques and extra registers for marking and storing the solutions are used in the modified algorithm. This requires additional space but it is shown that the use of extra register and marking techniques can reduce the time complexity to $O(M+\log N)$.

Affiliated with

Also associated with

No associations

Rating

Modified Grover's Search Algorithm in O(M+logN)Steps 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 in O(M+logN)Steps, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modified Grover's Search Algorithm in O(M+logN)Steps will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-526652