Quantum Searching: A survey of Grover’s Algorithm and its Descendants
نویسنده
چکیده
One of computer science’s classic problems is that of the search. This paper will look at Lou K. Grover’s Quantum Search algorithm. This algorithm is used to search a database, or search space, that is not, and cannot be, sorted or structured. It can produce a quadratic speed up over any similar classical search. This paper will also look at some of the issues and advances that have come out of Grover’s Algorithm. This paper assumes a working knowledge with Quantum Computation.
منابع مشابه
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 efficienc...
متن کامل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 ...
متن کاملQuantum Implementation of Parrondo's Paradox
Quantum game theory [1–3] is a new field of science having its roots in both game theory and quantum information theory. For about a decade quantum computer scientists have been searching for new methods of quantum algorithm design. Thorough investigation of different quantum games may bring new insight into the development of quantum algorithms. It was shown that Grover’s algorithm [4] can be ...
متن کامل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 ...
متن کاملGrover’s Algorithm applied to the Molecular Distance Geometry Problem
Grover’s algorithm is a quantum algorithm for searching in unstructured databases. Due to the properties of quantum mechanics, it provides a quadratic speedup over its classical counterparts. We present a new application of the algorithm to the Molecular Distance Geometry Problem. This problem is related to the determination of the tridimensional structure of a molecule based on the knowledge o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004