Time Complexity Analysis - Grover
Let’s learn why Grover's Algorithm runs in O(sqrt(N)) time.
We'll cover the following...
This is going to be a geometric proof to show that the number of Grover iterations we must do to achieve a high probability of measuring the winner state is bounded by .
Equal superposition
We will carry forward what we’ve learned from the past lessons and start with the situation where some arbitrary state could be measured from the superposition, and it lies in between and in the state space. The state is orthogonal to and the angle between and is
Reflecting about the state
The state makes an angle with the , upon reflection about the state, our new state would end up with the same angle but on the opposite side.
Reflecting about the state
If we denote the angle between and as then after this reflection, our new state would have an angle of with . Using all the information we have gathered so far, we need to focus on finding the angle between our final state and the original state.
Take a look at the upper half (first and second quadrants) of the diagram given below, the sum of the angles should be equal to radians.
Let’s have a look at because that’s essentially the same state (ignoring global phase, the sign), which is now closer to . Remember that this state is simply in the opposite direction. Geometrically, the angle between and ...