Circuit implementation of Shor's algorithm for the factorization of small integers in Qiskit
To factor an integer N into a product of two other numbers N<sub>1</sub> and N<sub>2</sub>, Shor’s algorithm uses the Quantum Fourier Transform on n qubits, denoted QFT<sub>n</sub>, to determine the period r of a Modular Exponentiation Function (MEF), which is later used to compute a factor of N. In this work, we present Shor’s algorithm for factoring an integer of n qubits and illustrate an example with n=4. We implement our algorithm using Qiskit and IBM quantum computers, which also can be adapted on other quantum computing platforms with minor adjustments. We discuss the IBM quantum computer limitations for running our circuit and show the impact of device imperfections on the factored result.
Authors
- Hichem Eleuch (ORCID: https://orcid.org/0000-0002-4596-137X)
- Vasudevan Lakshminarayanan (ORCID: https://orcid.org/0000-0002-3473-1245)
- Amor Gueddana (ORCID: https://orcid.org/0000-0002-1753-2025)
- Iheb Eddine Gharbi
Institutions
- University of Waterloo (CA)
- University of Carthage (TN)
- University of Sharjah (AE)
Publication Details
- Published
- 2024-08-13
- DOI
- https://doi.org/10.1117/12.3026738
- Citations
- 1
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.35