Quite often in database search, we only need to extract portion of the information about the satisfying item. We consider this problem in the following form: the database of N items is separated into K blocks of size b = N / K elements each and an algorithm has just to find the block containing the item of interest. The queries are exactly the same as in the standard database search problem. We present a quantum algorithm for this problem of partial search that takes about 0.34 \(\sqrt{b}\) fewer iterations than the quantum search algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Grover L.K. (1997). Phys. Rev. Lett. 78(2): 325
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, 2000).
Zalka C. (1999). Phys. Rev. A 60: 2746
M. Heiligman, Finding Matches between Two Databases on a Quantum Computer, quant-ph/0006136.
L. K. Grover and J. Radhakrishnan, Is partial quantum search of a database any easier? quant-ph/0407122.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Korepin, V.E., Grover, L.K. Simple Algorithm for Partial Quantum Search. Quantum Inf Process 5, 5–10 (2006). https://doi.org/10.1007/s11128-005-0004-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11128-005-0004-z