Primitives

This submodule of Qrisp provides a collection of commonly used buildings blocks to build larger algorithms. Each function comes with comprehensive documentation and brief examples to help you understand its implementation and usage:

ALGORITHM	USED FOR
Quantum Fourier Transform	periodicity detection and phase estimation
Quantum Phase Estimation	estimating the eigenvalues of a unitary operator
Quantum Amplitude Amplification	enhancing amplitude of a target state
Quantum Amplitude Estimation	estimating the amplitude of a target state
Iterative Quantum Amplitude Estimation	resource efficient quantum amplitude estimation
Phase Polynomial Tools	provides functions for applying diagonal Hamiltonians given by polynomials
Grover’s Algorithm	unstructured search
Dicke state preparation	preparation of Dicke states, i.e., states with a given Hamming weight
Iterable Demuxing, Shifting, and Permutation	low-level manipulations of quantum arguments like QuantumVariable or QuantumArray
Quantum State Preparation	prepare a quantum state with given amplitudes
Quantum Switch Case	Executes a switch statement. The condition can be a QuantumVariable.
Prefix arithmetic	several arithmetic functions that allow better control over precision and output types than the infix version

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