pith. sign in

arxiv: 1102.2058 · v1 · pith:5WEPFUDBnew · submitted 2011-02-10 · 🪐 quant-ph

Quantum Algorithms: Database Search and its Variations

classification 🪐 quant-ph
keywords quantumalgorithmssearchalgorithmdatabaseactivealthoughanalogues
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.