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:

    “There must be a solemn and terrible aloneness that comes over the child as he takes those first independent steps. All this is lost to memory and we can only reconstruct it through analogies in later life....To the child who takes his first steps and finds himself walking alone, this moment must bring the first sharp sense of the uniqueness and separateness of his body and his person, the discovery of the solitary self.”
    —Selma H. Fraiberg (20th century)