Quantum speedups for unstructured problems: Solving two twenty-year-old problems
One of the goals of quantum computing research is to understand which problems quantum computers can solve faster than classical (non-quantum) computers and how big the speedup can be. Grover’s algorithm and Shor’s algorithm are two famous quantum algorithms that yield a polynomial speedup and…