Algorithm Steps
The steps of Grover's algorithm are given as follows. Let denote the uniform superposition over all states
- .
Then the operator
is known as the Grover diffusion operator.
Here is the algorithm:
- Initialize the system to the state
-
- Perform the following "Grover iteration" r(N) times. The function r(N), which is asymptotically O(N½), is described below.
- Apply the operator .
- Apply the operator .
- Perform the measurement Ω. The measurement result will be λω with probability approaching 1 for N≫1. From λω, ω may be obtained.
Read more about this topic: Grover's Algorithm
Famous quotes containing the word steps:
“Every child has an inner timetable for growtha pattern unique to him. . . . Growth is not steady, forward, upward progression. It is instead a switchback trail; three steps forward, two back, one around the bushes, and a few simply standing, before another forward leap.”
—Dorothy Corkville Briggs (20th century)