Abstract
The quantum factorization effectiveness is limited both by inherent randomness of the quantum measurement and requirement of special selection of parameters controlling behavior of classic algorithms supporting quantum device operation. However, only coarse bounds on probability of successful parameters selection have been published so far. The proof of an exact expression on factorization efficiency constitutes the main contribution of the paper. The proved expression simply relates Shor’s algorithm efficiency to properties of the factors forming the composite number.
Article PDF
Similar content being viewed by others
References
Bourdon P.S., Williams H.T.: Probability estimates for Shors algorithm. Quant. Inf. Comput. 7(5 & 6), 522–550 (2007)
Ekert A., Jozsa R.: Quantum computation and Shor’s factoring algorithm. Rev. Mod. Phys. 68(3), 733–753 (1996). doi:10.1103/RevModPhys.68.733
Gerjuoy, E.: Shor’s factoring algorithm and modern cryptography. An illustration of the capabilities inherent in quantum computers. Am. J. Phys. 73(6), 521–540 (2005). http://arxiv.org/pdf/quant-ph/0411184
Knill, E.: On Shor’s quantum factor finding algorithm: Increasing the probability of success and tradeoffs involving the Fourier Transform modulus. Technical Report, LAUR-95-3350, Los Alamos National Laboratory (1995) http://www.eskimo.com/knill/cv/reprints/knill:qc1995c.ps
McAnally, D.: A refinement of Shor’s algorithm (2001). http://xxx.lanl.gov/pdf/quant-ph/0112055
Nielsen M.A., Chuang I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978). doi:10.1145/359340.359342. http://theory.lcs.mit.edu/rivest/rsapaper.pdf
Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Sci. Stat. Comput. 26, 1484–1509 (1997). http://www.citebase.org/abstract?id=oai:arXiv.org:quant-ph/9508027
Zawadzki, P.: Numerical estimation of the quantum factorization effectiveness. Theor. Appl. Inform. 22(1), 63–72 (2010). doi:10.2478/v10179-010-0019-8
Open Access
This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Zawadzki, P. Closed-form formula on quantum factorization effectiveness. Quantum Inf Process 12, 97–108 (2013). https://doi.org/10.1007/s11128-012-0360-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11128-012-0360-4