An Analysis of Quantum Factoring using Shors Algorithm

Abstract

The most spectacular discovery of quantum computation, Shor's algorithm, efficiently solves the prime factorization problem: given a composite odd positive integer N, finding its prime factors. Shor’s algorithm is used to factor numbers into their components. Since the difficulty of factoring is believed to be exponentially hard it forms the basis of most modern crypto systems. In this paper we have analyzed Shor’s Algorithm and the quantum circuits on which it operates. Shor’ algorithm is analyzed using LibQuantum. The critical parts of Shor’s algorithm contribute great efficiency compared to classical algorithms.