Quantum Algorithm Zoo🔒 SSL Verified

Table of Contents

• ↓ Algebraic and Number Theoretic Algorithms
• ↓ Oracular Algorithms
• ↓ Approximation and Simulation Algorithms
• ↓ Optimization, Numerics, and Machine Learning
• ↓ Acknowledgments
• ↓ References
• ↓ Top Alternatives to quantumalgorithmzoo.org

6-Month Traffic Trend Estimate

Official Contact & Profiles

Visual representation extracted from quantumalgorithmzoo.org

Content Snippets from quantumalgorithmzoo.org

"This is a comprehensive catalog of quantum algorithms. If you notice any errors or omissions, please email me at [email protected]. (Alternatively, you may submit a pull request to the repository on GitHub.) Although I cannot guarantee a prompt response, your help is appreciated and will be acknowledged."

"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. Otherwise I call it polynomial. For a review of the \( O, \Omega, \Theta, \widetilde{O}, ... \) notations see the Wikipedia article."

Key Topics & Focus Areas for quantumalgorithmzoo.org:

Algebraic and Number Theoretic Algorithms

Oracular Algorithms

Approximation and Simulation Algorithms

Optimization, Numerics, and Machine Learning

Acknowledgments

References