Evidence for Large Quantum Speedups Is Strongest for Factoring and Quantum Simulation
Polynomial-time quantum algorithms for factoring and quantum simulation are backed by complexity theory. Grover search gains are at most quadratic. Optimization and machine learning on ordinary data rely mostly on heuristics, and researchers have matched several claimed speedups classically.




