Description
Grover’s search algorithm is one of the first and most prominent examples to show how a quantum circuit can be magnitudes faster than a classical algorithm. In the previous post, we built a…
Summary
- The importance of circuit identities Grover’s search algorithm is one of the first and most prominent examples to show how a quantum circuit can be magnitudes faster than a classical algorithm.
- Of course, qubits are the computational unit we work with.
- It is the task of the diffuser to magnify the amplitude to favor the searched state.
- Image by author, Frank Zickert We end up with our qubit in the desired state |1⟩ because the Hadamard gate turns the state |−⟩ into |1⟩.
- The following figure depicts the rotations we apply in this circuit.