Grover’s Algorithm: I

We will first discuss computational complexity analysis before we introduce Grover’s algorithm that has a quadratic speedup over classical algorithms. Grover’s algorithm is a search algorithm, and it is very instructive to show how the solution stands out from an equal superposition state after repetitive applications of a quantum circuit. We will use a graphical method to understand the algorithm. We will also learn how to encode a problem in the quantum circuit using basis encoding.