QUANTUM SEARCH ALGORITHMS

• Published in: International journal of modern physics. B, Condensed matter physics, statistical physics, applied physics Vol. 23; no. 31; pp. 5727 - 5758
• Main Authors: KOREPIN, VLADIMIR E., XU, YING
• Format: Journal Article
• Language: English
• Published: World Scientific Publishing Company 20.12.2009
• Subjects: group theory; Grover search; partial search
• ISSN: 0217-9792; 1793-6578
• DOI: 10.1142/S0217979209054922

This article reviews recent progress in quantum database search algorithms. The subject is presented in a self-contained and pedagogical way. The problem of searching a large database (a Hilbert space) for a target item is performed by the famous Grover algorithm which locates the target item with high probability and a quadratic speed-up compared with the corresponding classical algorithm. If the database is partitioned into blocks and one is searching for the block containing the target item instead of the target item itself, then the problem is referred to as partial search. Partial search trades accuracy for speed and the most efficient version is the Grover–Radhakrishnan–Korepin (GRK) algorithm. The target block can be further partitioned into sub-blocks so that GRK's can be performed in a sequence called a hierarchy. We study the Grover search and GRK partial search in detail and prove that a GRK hierarchy is less efficient than a direct GRK partial search. Both the Grover search and the GRK partial search can be generalized to the case with several target items (or target blocks for a GRK). The GRK partial search algorithm can also be represented in terms of group theory.