Grover's algorithm

(redirected from Grover algorithm)

Grover's algorithm

[¦grō·vərz ′al·gə‚rith·əm]
(computer science)
An algorithm for finding an item in a database of 2 N items, using a quantum computer, in a time of order 2 N /2steps instead of order 2 N steps.
References in periodicals archive ?
Grover algorithm is the kind of quantum searching method which can search a particular element in an unsorted database.
Palmprint Matching Algorithm Based on Grover Algorithm and Quantum Set Operations
Therefore, in this paper, we propose a matching method by using Grover algorithm and quantum set operations.
The next step is to apply Grover algorithm in searching out the location of the matching palmprint in database.
We use speed and accuracy to compare our Grover algorithm and quantum set operations with traditional Euclidean distance method.
In Table 1, we can get that the matching numbers of our algorithm which combines the quantum set operations with Grover algorithm only need 8 times, that the traditional algorithm which calculates the Euclidean distance will need 64 times, and that our method has square root of the traditional one.
Eventually, palmprint matching processing is carried out by using Grover algorithm and quantum set operations.
The mechanism on which the basophils rely to detect the antibody's presence may be analogous to the device underlying Shor's algorithm or to the Grover algorithm for databank search, which is also based on Shor's ideas.
The postcondition we are interested in for the Grover algorithm is that the correct solution is found, i.e., S = |[x.sub.0]>.
Thus the number of iterations in the Grover algorithm for a search space of size N should be the closest whole number to H(N).
Shepelyansky, "Dissipative decoherence in the Grover algorithm," European Physical Journal D, vol.