This algorithms submodule of Qrisp provides a collection of commonly used quantum algorithms that can be used to solve a variety of computational problems. Each algorithm comes with comprehensive documentation and brief examples to help you understand its implementation and usage:



Quantum Fourier Transform

periodicity detection and phase estimation

Quantum Phase Estimation

estimating the eigenvalues of a unitary operator


solving combinatorial optimizatin problems

Grover’s Algorithm

unstructured search

Quantum Backtracking Algorithms

solving constraint-satisfaction problems like 3-SAT or the Traveling Salesman Problem (TSP)

Quantum Counting

estimating the amount of solutions for a given Grover oracle

Iterable Demuxing, Shifting, and Permutation

low-level manipulations of quantum arguments like QuantumVariable or QuantumArray

We encourage you to explore these algorithms, delve into their documentation, and experiment with their implementations.