← Back to Glossary

Grover's Algorithm

Intermediate Algorithms
A quantum algorithm that searches an unstructured database quadratically faster than classical algorithms.

📖 In-Depth Explanation

Grover's algorithm can find a marked item among N items in O(√N) steps, compared to O(N) classically. While not exponentially faster, this quadratic speedup is significant for search and optimisation problems.