Some problems and their algorithms that we know (or hope to know) how to efficiently implement on a quantum computer.
- Deutsch-Jozsa algorithm
- Grover's search algorithm
- Shor's factoring algorithm
- The hidden subgroup problem
- Graph isomorphism
- Computing the Jones Polynomial
- Element distinctness (Ambianis's Algorithm)
- Quantization of Classical walk based algorithms (e.g. Szegedy)
- Graph traversal (Childs et al.)
Pages in category "Quantum Algorithms"
The following 4 pages are in this category, out of 4 total.