Grover's Algorithm

Grover’s algorithm is a quantum search algorithm that finds a target item in an unsorted database of elements in roughly steps, offering a quadratic speedup over classical search. It works by repeatedly amplifying the probability amplitude of the correct answer using an “oracle” that marks the desired item. After enough iterations, measuring the quantum state yields the correct result with high probability.