A Grover-based quantum search of optimal order for an unknown number of marked elements

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 pages, Latex, 2 figures

Scientific paper

We want to find a marked element out of a black box containing N elements. When the number of marked elements is known this can be done elegantly with Grover's algorithm, a variant of which even gives a correct result with certainty. On the other hand, when the number of marked elements is not known the problem becomes more difficult. For every prescribed success probability I give an algorithm consisting of several runs of Grover's algorithm that matches a recent bound by Buhrman and de Wolf on the order of the number of queries to the black box. The improvement in the order over a previously known algorithm is small and the number of queries can clearly still be reduced by a constant factor.

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 Grover-based quantum search of optimal order for an unknown number of marked elements 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 Grover-based quantum search of optimal order for an unknown number of marked elements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Grover-based quantum search of optimal order for an unknown number of marked elements will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-362557

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