Multi-object searching algorithm using subgrouped oracles

Details Multi-object searching algorithm using subgrouped oracles Multi-object searching algorithm using subgrouped oracles

2002-05-28

arxiv.org/abs/quant-ph/0205175v3

Physics

Quantum Physics

4 pages, 1 figures, RevTex4

Scientific paper

We present in this work, if a set of well organized suboracles is available, an algorithm for multiobject search with certainty in an unsorted database of $N$ items. Depending on the number of the objects, the technique of phase tunning is included in the algorithm. If one single object is to be searched, this algorithm performs a factor of two improvement over the best algorithm for a classical sorted database. While if the number of the objects is larger than one, the algorithm requires slightly less than $\log_{4}N$ queries, but no classical counterpart exists since the resulting state is a superposition of the marked states.

Affiliated with

Also associated with

No associations

Rating

Multi-object searching algorithm using subgrouped oracles 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 Multi-object searching algorithm using subgrouped oracles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-object searching algorithm using subgrouped oracles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-560653