Grover's Algorithm - Algorithm Steps

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:

  1. Initialize the system to the state
  2. Perform the following "Grover iteration" r(N) times. The function r(N), which is asymptotically O(N½), is described below.
    1. Apply the operator .
    2. Apply the operator .
  3. 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:

    “Perhaps of all our untamed quadrupeds, the fox has obtained the widest and most familiar reputation.... His recent tracks still give variety to a winter’s walk. I tread in the steps of the fox that has gone before me by some hours, or which perhaps I have started, with such a tip-toe of expectation as if I were on the trail of the Spirit itself which resides in the wood, and expected soon to catch it in its lair.”
    —Henry David Thoreau (1817–1862)