Quest for Fast Partial Search Algorithm

Authors:
Vladimir E. Korepin;Jinfeng Liao
Affiliations:
C.N. Yang Institute for Theoretical Physics, State University of New York at Stony Brook, Stony Brook, USA 11794-3840;Department of Physics and Astronomy, State University of New York at Stony Brook, Stony Brook, USA 11794-3840
Venue:
Quantum Information Processing
Year:
2006

Citing 2
Cited 2

Is partial quantum search of a database any easier?

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Simple Algorithm for Partial Quantum Search

Quantum Information Processing

Sure Success Partial Search

Quantum Information Processing
Quantum Partial Search of a Database with Several Target Items

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Grover quantum algorithm can find a target item in a database faster than any classical algorithm. In partial search, one trades accuracy for speed, and a part of the database (a block) containing the target item can be found even faster. We consider different partial search algorithms and argue that the algorithm originally suggested by Grover and Radhakrishnan and modified by Korepin is the optimal one. The efficiency of an algorithm is measured by the number of queries to the oracle.