A Family of Grover’s Quantum Searching Algorithms
نویسنده
چکیده
We introduce the concepts of Grover operators and Grover kernels to systematically analyse Grover’s searching algorithms. Then, we investigate a one-parameter family of quantum searching algorithms of Grover’s type and we show that the standard Grover’s algorithm is a distinguished member of this family. We show that all the algorithms of this class solve the searching problem with an efficiency of order O( √ N), with a coefficient which is class-dependent. The analysis of this dependence is a test of the stability and robustness of the algorithms. We show the stability of this constructions under perturbations of the initial conditions and extend them upon a very general class of Grover operators.
منابع مشابه
Quantum Counting
We study some extensions of Grover’s quantum searching algorithm. First, we generalize the Grover iteration in the light of a concept called amplitude amplification. Then, we show that the quadratic speedup obtained by the quantum searching algorithm over classical brute force can still be obtained for a large family of search problems for which good classical heuristics exist. Finally, as our ...
متن کاملA Fast Natural Algorithm for Searching: Preliminary version
In this note we present two natural algorithms—one for sorting and another for searching a sorted list of items. Both algorithms work in O( √ N) time, N being the size of the list. A combination of these algorithms can search an unsorted list in O( √ N) time, an impossibility for classical algorithms. The same complexity is achieved by Grover’s quantum search algorithm; in contrast to Grover’s ...
متن کاملQuantum searching’s underlying SU(2) structure and its quantum decoherence effects
The search operation for a marked state by means of Grover’s quantum searching algorithm is shown to be an element of group SU(2) which acts on a 2-dimensional space spanned by the marked state and the unmarked collective state. Based on this underlying structure, those exact bounds of the steps in various quantum search algorithms are obtained in a quite concise way. This reformulation of the ...
متن کاملSimilarity between Grover’s quantum search algorithm and classical two-body collisions
By studying the diffusion operator in Grover’s quantum search algorithm, we find a mathematical analogy between quantum searching and classical, elastic two-body collisions. We exploit this analogy using a thought experiment involving multiple collisions between two-bodies to help illuminate why Grover’s quantum search algorithm works. Related issues are discussed. PACS numbers: 03.67. Quantum ...
متن کاملA fast natural algorithm for searching
In this note we present two natural algorithms—one for sorting, and another for searching a sorted list of items. Both algorithms work in O( √ N ) time, N being the size of the list. A combination of these algorithms can search an unsorted list in O( √ N ) time, an impossibility for classical algorithms. The same complexity is achieved by Grover’s quantum search algorithm; in contrast to Grover...
متن کامل