Algorithm
Grover Search
Problem: find a marked item in an unsorted space with fewer checks than brute force.
Expected output
The marked state |11> should be amplified.
Algorithm
Problem: find a marked item in an unsorted space with fewer checks than brute force.
The marked state |11> should be amplified.
Mark the target with phase, then reflect amplitudes so the target grows.
Prepare all states, apply oracle-like phase marking, then diffuse.
Grover shows quadratic speedup for unstructured search-style problems.
It does not make search instant, and real oracles can be expensive.
# Grover (mark |11>) qubits 2 H 0 H 1 Z 0 Z 1 H 0 H 1 CX 0 1 Z 1 CX 0 1 H 0 H 1 MEASURE 0 MEASURE 1
What is Grover trying to do to the marked answer?