Affiliation:
1. BITS Pilani
2. Military Technological College
Abstract
Abstract
It is well known that Shor's algorithm is a revolutionary quantum algorithm designed to find the two prime factors of a large integer that is a product of these primes. Since then, several research groups have worked on implementing this algorithm, but for factorizing numbers like 15, 21, 35, etc., because of quantum hardware's limitations in efficiently handling many qubits. All these examples are similar in the sense that they are expressible as the product of two distinct prime factors. However, in this paper, we attempt to implement Shor's algorithm for a perfect square, say, 49, and present our observations.
Publisher
Research Square Platform LLC
Reference11 articles.
1. Shor, P.W., 1994. Algorithms for quantum computation: Discrete logarithms and factoring, in: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC, USA. pp. 124–134.
2. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer;Shor PW;SIAM Journal on Computing,1997
3. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer;Shor PW;SIAM review,1999
4. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, England, 2000.
5. Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance;Vandersypen Lieven MK;Nature,2001