Physics – Quantum Physics
Scientific paper
2000-11-06
Physics
Quantum Physics
17 pages, 1 figure
Scientific paper
Consider the unstructured search of an unknown number l of items in a large unsorted database of size N. The multi-object quantum search algorithm consists of two parts. The first part of the algorithm is to generalize Grover's single-object search algorithm to the multi-object case and the second part is to solve a counting problem to determine l. In this paper, we study the multi-object quantum search algorithm (in continuous time), but in a more structured way by taking into account the availability of partial information. The modeling of available partial information is done simply by the combination of several prescribed, possibly overlapping, information sets with varying weights to signify the reliability of each set. The associated statistics is estimated and the algorithm efficiency and complexity are analyzed. Our analysis shows that the search algorithm described here may not be more efficient than the unstructured (generalized) multi-object Grover search if there is ``misplaced confidence''. However, if the information sets have a ``basic confidence'' property in the sense that each information set contains at least one search item, then a quadratic speedup holds on a much smaller data space, which further expedite the quantum search for the first item.
Chen Goong
Diao Zijian
No associations
LandOfFree
Quantum Multi-object Search Algorithm with the Availability of Partial Information 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 Quantum Multi-object Search Algorithm with the Availability of Partial Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Multi-object Search Algorithm with the Availability of Partial Information will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-708216