Grover's algorithm


Also found in: Wikipedia.

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's Algorithm on a quantum computer allows for database searches in the square root of N instead.
When put to work in a "larger" quantum computer, Grover's Algorithm could spell the end for encryption such as DES.
While Shor's algorithm may be of more immediate utility, Grover's algorithm seems more interesting in a theoretical sense, as it highlights an area of fundamental superiority in quantum computation.
The idea of Grover's algorithm is to place the register in an equal superposition of all states, and then selectively invert the phase of the marked state, and then perform an inversion about average operation a number of times.
This Grover's algorithm flow chart is as shown in Figure 1.
The proposed system is concerned with the simulation of Grover's Algorithm using MATLAB.
Appendix A contains the Matlab commands to simulate Grover's algorithm using six qubits.
In this simple example of Grover's algorithm, a haystack function is used to represent the database.
Grover's algorithm works by iteratively applying the inversion about the average operator to the current state.
Foremost among these is how many times exactly we should iterate step 2 of Grover's algorithm.
If an amplitude of type A is detected, THEN trigger macroscopic reaction R where "type A" may be characterized by a condition such as that in Grover's algorithm, i.
Deutsch-Jozsa's algorithm for the rapid solution [1-3], Shor's algorithm for the factorization [2-4], Grover's algorithms for the database search [2,5-7] and so on are known, and efforts to expand applications of the quantum calculation are continued.