next up previous contents
Next: Corollary 1.1 Up: Proof that Algorithm Increases Previous: Proof that Algorithm Increases   Contents

Theorem 1

Theorem 1: Given the state vector of our register with one state with amplitude k, and every other state with amplitude l, after an application of A:

Proof: Given the definition of A as Aij = 2/N if i $ \not=$j and Aii = - 1 + 2/N, it follows from the definition of matrix multiplication of k and l by A that:

The second expression simplifies to l' = $ {\frac{{2}}{{N}}}$k + $ {\frac{{(N-2)}}{{N}}}$l with some simple algebraic manipulation. [Grover96]


next up previous contents
Next: Corollary 1.1 Up: Proof that Algorithm Increases Previous: Proof that Algorithm Increases   Contents
Matthew Hayward - Quantum Computing and Grover's Algorithm GitHub Repository