Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Shor, P.W., Algorithms for quantum computation: Discrete logarithms and factoring, Proc. of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, 1994, Los Alamitos, Calif., IEEE Computer Society, 1994, pp. 124–134.
Shor, P.W., Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comp., 1997, vol. 26, no. 5. pp. 1484–1509.
Nielsen, M. and Chuang, I., Quantum Computation and Quantum Information, Cambridge: Cambridge Univ. Press, 2000.
Coppersmith, D., An approximate Fourier transform useful in quantum factoring, arXiv:quant-ph/0201067 (2002).
Barenco, A., Ekert A., Suominen, K.A., and Törmä, P., Approximate quantum Fourier transform and decoherence, Phys. Rev. A, 1996, vol. 54, no. 1. pp. 139–146.
Prokopenya, A.N., Approximate quantum Fourier transform and quantum algorithm for phase estimation, in Int. Workshop on Computer Algebra in Scientific Computing CASC2015, Gerdt, V.P., Koepf, W., Mayr, E.W., and Vorozhtsov, E.V., Eds., Lect. Notes Comput. Sci. vol. 9301, Berlin: Springer, 2015, pp. 391–405.
D. Cheung, Improved bounds for the approximate QFT, arXiv:quant-ph/0403071 (2004).
Gerdt V.P., Kragler R., and Prokopenya, A.N., A Mathematica program for constructing quantum circuits and computing their unitary matrices, Phys. Particles Nuclei Lett., 2009, vol. 6, no. 7. pp. 526–529.
Gerdt V.P. and Prokopenya, A.N., Some algorithms for calculating unitary matrices for quantum circuits, Program. Comput. Software, 2010, vol. 36, no. 2. pp. 111–116.
Gerdt V.P. and Prokopenya A.N., The circuit model of quantum computation and its simulation with Mathematica, Proc. of MMCP 2011, Stará Lesná, High Tatra Mountains, Slovakia, 2011, G. Adam, J. Buša, and M. Hnatic, Eds., Lect. Notes Comput. Sci, vol. 7175, Heidelberg: Springer, 2012, pp. 43–55.
Gerdt V.P. and Prokopenya A.N., Simulation of quantum error correction by means of QuantumCircuit package, Program. Comput. Software, 2013, vol. 39, no. 3. pp. 143–149.
Gerdt V.P. and Prokopenya A.N., Simulation of quantum error correction with Mathematica, in Int. Workshop on Computer Algebra in Scientific Computing CASC2013, Gerdt, V.P., Koepf, W., Mayr, E.W., and Vorozhtsov, E.V., Eds., Lect. Notes Comput. Sci. vol. 8136, Berlin: Springer, 2013, pp. 116–129.
Prokopenya, A.N., Simulation of a quantum algorithm for phase estimation, Program. Comput. Software, 2015, vol. 41, no. 2. pp. 98–104.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.N. Prokopenya, 2016, published in Programmirovanie, 2016, Vol. 42, No. 2.
Rights and permissions
About this article
Cite this article
Prokopenya, A.N. Approximation of a quantum algorithm for order finding. Program Comput Soft 42, 90–98 (2016). https://doi.org/10.1134/S0361768816020080
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0361768816020080