We have now covered all the prerequisite material needed to being to understand some quantum algorithms.

The ‘proof of concept’ algorithms are a good introduction to quantum algorithms and show the advantages of quantum computation, but these algorithms are not generally considered useful aside from demonstrating quantum phenomena.

After this there is no ‘correct’ order in which to learn about quantum algorithms, but I have tried to organise them in terms of similarity. It is possible to read quite deeply about each algorithm: its applications and generalisations, where it excels, how it is physically implemented, and how it competes with its classical counterparts. Which algorithms you learn about, and how deeply you learn about them depends on your needs and the reasons you are learning about quantum computing.

- Proof of Concept Algorithms
- The Deutsch-Joza Algorithm
- Simon's Algorithm
- Grover's Algorithm
- The Quantum Fourier Transform
- Quantum Phase Estimation
- Shor's Algorithm
- Period Finding
- Shor's Algorithm
- Quantum Algorithm for Linear Systems of Equations
- Quantum Machine Learning