## Cirq

The following code block implements **Grover’s Algorithm** for $n=2$ bits. The bit-string to find in the collection is randomly generated. For this setup, we only need to run through the algorithm once because of the bound $\approx\frac{\pi\sqrt{N}}{4}$.

Get hands-on with 1200+ tech skills courses.