Calculates GCD (Greatest common divisor) and Bézout coefficents.

Factors integers using quantum spectographer and modular exponentiation.
Classical algorithm complexity is O(2 ^ square root of N) while quantum is O(N^3).

Finds elements in sudoku-style matrix using Grover quantum search algorithm.
Classical algorith complexity is O(N) while quantum is O(square root of N).

Uses Grover`s algorithm and QPE to count the number of solutions for given search problem.

Determines hidden message encoded in black-box function.
Classical algorith complexity is O(N) while quantum is O(1).

Estimates amplitude of quantum state using carefully calculated powers of Grover iterations.
Does not use Quantum Phase Estimation and Inverse Quantum Fourier Transform parts.
Produces much more compact Quantum Circuit compared to Canonical QAE.

Transfers quantum state using 2 entangled qubits and 2 classical bits.

Finds period of black-box function.
Classical algorithm complexity is O(2^N) while quantum is O(N^3).

Applies discrete Fourier transform to quantum state amplitudes.
Classical algorithm complexity is O(N*2^N) while quantum is O(N*log(N)).

Estimates phase for unitary operator.

Estimates amplitude of quantum state.

Finds elements which satisfy constraints determined by black-box function.
Classical algorith complexity is O(N) while quantum is O(square root of N).

Determines if black-box function is constant (returns all 1 or all 0) or balanced (returns half of 1 and half of 0).
Classical algorith complexity is O(2^N) while quantum is O(1).

Securely communicates a private key from one party to another.
Uses quantum channel and authenticated public classical channel.