Algorithm State
Optimal k*--
P(success)--
Target amplitude--
Classical queries--
Quantum queries--
Grover iterate: G = -H^⊗n I₀ H^⊗n O_f
After k iterations: sin²((2k+1)θ) where sinθ = √(M/N)
Optimal: k* = ⌊(π/4)√(N/M)⌋
Speedup: O(√N) vs classical O(N)