Open Access

ARTICLE

Analysis of Innovative Quantum Optimization Solutions for Shor’s Period Finding Algorithm Applied to the Computation of

Kaleb Dias Antoine KODO^1,*, Eugène C. EZIN^1,2

1 Institut de Formation et de Recherche en Informatique, University of Abomey-Calavi, Abomey-Calavi, 01 BP 526 Cotonou, Benin
2 Institut de Mathématiques et de Sciences Physiques, University of Abomey-Calavi, Dangbo, BP 613 Porto-Novo, Benin

* Corresponding Author: Kaleb Dias Antoine KODO. Email:

Journal of Quantum Computing 2025, 7, 17-38. https://doi.org/10.32604/jqc.2025.059089

Received 27 September 2024; Accepted 12 March 2025; Issue published 08 April 2025

Abstract

In the rapidly evolving domain of quantum computing, Shor’s algorithm has emerged as a groundbreaking innovation with far-reaching implications for the field of cryptographic security. However, the efficacy of Shor’s algorithm hinges on the critical step of determining the period, a process that poses a substantial computational challenge. This article explores innovative quantum optimization solutions that aim to enhance the efficiency of Shor’s period finding algorithm. The article focuses on quantum development environments, such as Qiskit and Cirq. A detailed analysis is conducted on three notable tools: Qiskit Transpiler, BQSKit, and Mitiq. The performance of these tools is evaluated in terms of execution time, precision, resource utilization, the number of quantum gates, circuit synthesis optimization, error mitigation, and qubit fidelity. Through rigorous case studies, we highlight the strengths and limitations of these tools, shedding light on their potential impact on integer factorization and cybersecurity. Our findings underscore the importance of quantum optimization and lay the foundation for future developments in quantum algorithmic enhancements, particularly within the Qiskit and Cirq quantum development environments.

---

Keywords

---