# Grover's algorithm Given a function $f:\{0,\dots,N-1\} \to \{0,1\}$ (that can be evaluated on a quantum computer) such that there is a *unique* value $w$ for which $f(w)=1$, Grover's algorithm finds $w$ in $O(\sqrt N)$ operations, using $\lceil \log_{2}N \rceil$ qubits. ## Links [3blue1brown](https://www.youtube.com/watch?v=RQWpF2Gb-gU) [Wikipedia](https://en.wikipedia.org/wiki/Grover%27s_algorithm)