Quantum Algorithm Zoo

This is a comprehensive catalog of quantum algorithms. If there exists a positive constant \( \alpha \) such that the runtime \( C(n) \) of the best known classical algorithm and the runtime \( Q(n) \) of the quantum algorithm satisfy \( C = 2^{\Omega(Q^\alpha)} \) then I call the speedup superpolynomial. For a review of the \( O, \Omega, \Theta, \widetilde{O}, … \) notations see the Wikipedia article.

Source: quantumalgorithmzoo.org