Approximation of a quantum algorithm for order finding

Resumo

A quantum algorithm for the computation the order of an integer, which uses the quantum Fourier transform, is discussed. The cases of the exact and approximate Fourier transform are considered, and estimates of the probability of the successful solution of the problem that significantly improve the available results are obtained. The quantum algorithm for order finding is simulated using the QuantumCircuit package written in the computer algebra system Wolfram Mathematica, and its efficiency in combination with the approximate Fourier transform is demonstrated.