Quantum Algorithms: Database Search and its Variations
arXiv:1102.2058
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 is a pedagogical article. 12 pages
References in corpus (9)
- Strengths and Weaknesses of Quantum Computing
- A Quantum Random Walk Search Algorithm
- Grover's quantum searching algorithm is optimal
- Faster quantum walk algorithm for the two dimensional spatial search
- Spatial search and the Dirac equation
- Quantum Random Walks do not need a Coin Toss
- Search on a Hypercubic Lattice using a Quantum Random Walk: I. d>2
- Quantum Database Search can do without Sorting
- Towards Understanding the Origin of Genetic Languages