Quantum Partial Search of a Database with Several Target Items

We consider unstructured database separated into blocks of equal size. Blocks containing target items are called target blocks. Blocks without target items are called non-target blocks. We present a fast quantum algorithm, which finds one of the target blocks. The algorithm uses the same oracle, which the main Grover algorithm does. We study the simplest case, when each target block has the same number of target items. Our algorithm is based on Boyer, Brassard, Hoyer, and Tapp algorithm of searching database with several target items and on Grover–Radhakrishnan algorithm of partial search. We minimize the number of queries to the oracle. We analyze the algorithm for blocks of large size. In next publications we shall consider more general case when the number of target items is different in different target blocks.

[1]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[2]  Seth Lloyd,et al.  Quantum Information Processing , 2009, Encyclopedia of Complexity and Systems Science.

[3]  Lov K. Grover,et al.  Simple Algorithm for Partial Quantum Search , 2006, Quantum Inf. Process..

[4]  Vladimir E. Korepin,et al.  Optimization of Partial Search , 2005, ArXiv.

[5]  Vladimir E. Korepin,et al.  Quest for Fast Partial Search Algorithm , 2006, Quantum Inf. Process..

[6]  Samuel L. Braunstein,et al.  Sure Success Partial Search , 2007, Quantum Inf. Process..

[7]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[8]  Gilles Brassard,et al.  Tight bounds on quantum searching , 1996, quant-ph/9605034.

[9]  Jaikumar Radhakrishnan,et al.  Is partial quantum search of a database any easier? , 2005, SPAA '05.