A Quantum Search Algorithm for a Specified Number of Targets

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages including 1 figure

Scientific paper

The quantum search algorithm of Chen and Diao, which finds with certainty a single target item in an unsorted database, is modified so as to be capable of searching for an arbitrary specified number of target items. If the number of targets, nu_0, is a power of four, the new algorithm will with certainty find one of the targets in a database of n items using (1/2)(3(N/nu_0)^{log_base_4(3)}-1) \approx (1/2)(3(N/nu_0)^{0.7925}-1) oracle calls, where N is the smallest power of four greater than or equal to n. If nu_0 is not a power of four, the algorithm will, with a probability of at least one-half, find one of the targets using no more than (1/2)(9(N/nu)^{log_base_4(3)}-1) calls, where nu is the smallest power of four greater than or equal to nu_0.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Quantum Search Algorithm for a Specified Number of Targets 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 A Quantum Search Algorithm for a Specified Number of Targets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Quantum Search Algorithm for a Specified Number of Targets will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-564600

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.