Robustness of the quantum search algorithm
B. Pablo-Norman, M. Ruiz-Altaba · AIP conference proceedings · 1999
We find exact results for Grover's quantum search algorithm and analyze its behavior under noisy situations when no quantum correction codes are available.We compute how the algorithm slows down: it is still better than a classical one, provided the noise is smaller than some bound, which we also compute.