Optimization of Partial Search

Details Optimization of Partial Search Optimization of Partial Search

2005-03-31

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

Journal of Physics A: Math. Gen. vol 38, pages L731-L738, 2005

Physics

Quantum Physics

5 pages

Scientific paper

Quantum Grover search algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster, this is partial search. A partial search algorithm was recently suggested by Grover and Radhakrishnan. Here we optimize it. Efficiency of the search algorithm is measured by number of queries to the oracle. The author suggests new version of Grover-Radhakrishnan algorithm which uses minimal number of queries to the oracle. The algorithm can run on the same hardware which is used for the usual Grover algorithm.

Affiliated with

Also associated with

No associations

Rating

Optimization of Partial Search 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 Optimization of Partial Search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimization of Partial Search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-721199