General framework for quantum search algorithms
arXiv:0806.1257 · doi:10.1103/PhysRevA.86.042331
Abstract
Grover's quantum search algorithm drives a quantum computer from a prepared initial state to a desired final state by using selective transformations of these states. Here, we analyze a framework when one of the selective trasformations is replaced by a more general unitary transformation. Our framework encapsulates several previous generalizations of the Grover's algorithm. We show that the general quantum search algorithm can be improved by controlling the transformations through an ancilla qubit. As a special case of this improvement, we get a faster quantum algorithm for the two-dimensional spatial search.
revised version
References in corpus (5)
Cited by in corpus (15)
- Faster quantum walk algorithm for the two dimensional spatial search
- Depth optimization of quantum search algorithms beyond Grover's algorithm
- Quantum walk-based search algorithms with multiple marked vertices
- Quantum search on the two-dimensional lattice using the staggered model with Hamiltonians
- Quantum search on noisy intermediate-scale quantum devices
- Engineering topological states and quantum-inspired information processing using classical circuits
- Faster quantum searching with almost arbitrary operators
- Spatial Search on Graphs with Multiple Targets using Flip-flop Quantum Walk
- Non-Markovian quantum interference in multilevel quantum systems: Exact master equation approach
- Element Distinctness Revisited
- Quantum computers can search rapidly by using almost any selective transformations
- Complexity Bounds on Quantum Search Algorithms in finite-dimensional Networks
- Staggered Quantum Walk on Hexagonal Lattices
- Postprocessing can speed up general quantum search algorithms
- Quantum search algorithm tailored to clause satisfaction problems