arXiv Analytics

Sign in

arXiv:1102.2058 [quant-ph]AbstractReferencesReviewsResources

Quantum Algorithms: Database Search and its Variations

Apoorva Patel

Published 2011-02-10Version 1

The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen. Clever quantum algorithms have been discovered in recent years, although not systematically, and the field remains under active investigation. This article is an introduction to the quantum database search algorithm. Its extension to the quantum spatial search algorithm is also described.

Comments: This is a pedagogical article. 12 pages
Journal: Physics News 40 (October 2010) 33-44
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:1005.4464 [quant-ph] (Published 2010-05-25)
Variations of the Lifshitz-van der Waals force between metals immersed in liquids
arXiv:2211.16533 [quant-ph] (Published 2022-11-29)
Variations on the Choi-Jamiolkowski isomorphism
arXiv:quant-ph/0506033 (Published 2005-06-03, updated 2006-09-26)
Variations on Quantum Oblivious Transfer