论文信息 - An Improved Quantum Algorithm for Searching an Ordered List

An Improved Quantum Algorithm for Searching an Ordered List

The best known quantum algorithm for searching an ordered list of N items is recursive and requires 3 log52 N ≈ 0.526 log2 N queries. We find an improved base case for this recursion, yielding an algorithm that requires only 4 log434 N ≈ 0.457 log2 N queries. This algorithm is more than twice as fast as the best possible classical algorithm, which requires log2 N queries.

Brian Jacokes

[1] Jan Neerbek,et al. Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness , 2002, Algorithmica.

[2] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[3] M. Sipser,et al. Invariant quantum algorithms for insertion into an ordered list , 1999, quant-ph/9901059.

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

[5] William H. Press,et al. Numerical recipes in C , 2002 .

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