A Qiskit-Based Simulation of Shor’s Algorithm
This study aims to explore the theoretical foundations and practical simulation of Shor’s algorithm, a quantum factoring algorithm technique that poses a considerable threat to classical cryptosystems, such as Rivest-Shamir-Adleman (RSA). It has simulated the period finding process and the factorization of the integer N = 15 with base a = 7 by using Qiskit, a quantum computing framework. The quantum circuit correctly identified the period r = 4 from the modular exponentiation function 7x mod 15, leading to factors of 15 as 3 and 5. The simulation shows how quantum superposition, interference, and the Quantum Fourier Transform (QFT) were useful for speeding up the period-finding process, which is important for integer factorization. The histogram of measurement results revealed prominent peaks at 4, 8, and 12, which are multiples of the resultant period, unveiling the constructive interference produced by the QFT. However, a dominant peak at 0000 indicates hardware noise and error, pointing to the current limitations in quantum hardware. Fault-tolerant computers and error-correcting codes can overcome this limitation. As we move towards the age of quantum computers, the applicability of this algorithm poses a great threat to digital security. Applied code and visualizations provide a reproducible foundation for further study on cybersecurity and quantum computing.
Authors
- Ram Krishna Tiwari (ORCID: https://orcid.org/0000-0003-4519-0365)
- Harihar Paudyal (ORCID: https://orcid.org/0000-0003-2651-9022)
- Aarati Adhikari
Institutions
- Tribhuvan University (NP)
- Birendra Multiple Campus (NP)
Publication Details
- Journal
- Api Journal of Science
- Published
- 2026-11-21
- DOI
- https://doi.org/10.3126/ajs.v3i1.100868
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.00