Which quantum algorithm provides quadratic speedup for searching unstructured databases?
- Shor's Algorithm
- Grover's Algorithm
- Quantum Fourier Transform
- Variational Quantum Eigensolver
Answer: Grover's Algorithm
Grover's Algorithm searches an unsorted database of N items in O(√N) queries vs O(N) classically. Applications: optimization, cryptography, and machine learning. Less dramatic than Shor's exponential speedup but broadly applicable. Requires coherent quantum operations; noise limits practical advantage on NISQ devices.