Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Information Technology

Enhanced Shor’s algorithm with quantum circuit optimization

Syed Shamikh Iqbal, Aasim Zafar

Published Feb 22, 2024• 20 citations
Publisher
DOI
10.1007/s41870-024-01741-0

Related papers

Enhanced Security Algorithm for Integer Factorization in Quantum Computing: Optimizing Shor’s Algorithm

Rashmi Kuksal, Sumit Chaudhary, Ashish Bhatt

International Conference on Innovative Mechanisms for Industry Applications•Oct 1, 2026•0 citations

Exploration of Design Alternatives for Reducing Idle Time in Shor's Algorithm: A Study on Monolithic and Distributed Quantum Systems

Moritz Schmidt, Abhoy Kole, Leon Wichette +3 more

Shor's algorithm is one of the most prominent quantum algorithms, yet finding efficient implementations remains an active research challenge. While many approaches focus on low-level modular arithmetic optimizations, a broader perspective can provide additional opportunities for improvement. By adopting a mid-level abstraction, we analyze the algorithm as a sequence of computational tasks, enabling systematic identification of idle time and optimization of execution flow. Building on this perspective, we first introduce an alternating design approach to minimize idle time while preserving qubit efficiency in Shor's algorithm. By strategically reordering tasks for simultaneous execution, we achieve a substantial reduction in overall execution time. Extending this approach to distributed implementations, we demonstrate how task rearrangement enhances execution efficiency in the presence of multiple distribution channels. Furthermore, to effectively evaluate the impact of design choices, we employ static timing analysis (STA)—a technique from classical circuit design—to analyze circuit delays while accounting for hardware-specific execution characteristics, such as measurement and reset delays in monolithic architectures and ebit generation time in distributed settings. Finally, we validate our approach by integrating modular exponentiation circuits from QRISP and constructing circuits for factoring numbers up to 64 bits. Through an extensive study across neutral atom, superconducting, and ion trap quantum computing platforms, we analyze circuit delays, highlighting trade-offs between qubit efficiency and execution time. Our findings provide a structured framework for optimizing compiled quantum circuits for Shor's algorithm, tailored to specific hardware constraints.

arXiv:2503.22564•IEEE Transactions on Quantum Engineering•Jan 1, 2025•1 citation

An Optimization of Shor's Algorithm Based on Quantum Parallelism

Shuaishuai Zhu, Ming Yuan

Lecture notes in electrical engineering•Jan 1, 2026•0 citations

Quantum Computing and Shor's Algorithm

Matt W. Hayward

•Jan 1, 2015•19 citations

Analyze Shor Algorithm Optimization Trends and Suggest Optimization Directions

Jaehan Cho, Dawit Shin, Yeonjeong Hwang +1 more

Quantum computers leverage the principles of quantum mechanics to solve complex problems beyond the capabilities of classical computers, such as prime factorization, which poses a significant threat to cryptographic algorithms like RSA and ECC. Although current quantum resources are insufficient for effective decryption, ongoing research focuses on optimizing Shor's algorithm to overcome these limitations. Shor's algorithm, a quantum algorithm designed for efficient integer factorization, exploits quantum parallelism and entanglement to perform prime factorization exponentially faster than classical algorithms. This paper reviews recent trends in Shor algorithm optimization, particularly in enhancing the efficiency of ripple-carry operators and the Karatsuba algorithm in multiplication and proposes a multiplication method that applies the Strassen algorithm to constant adders

International Conference on Platform Technology and Service•Aug 26, 2024•1 citation

Optimizing Shor’s Algorithm for N=15 and 21

Gabriele Herr, Xiao-Feng Qian

We investigate the optimization of Shor’s algorithm by exploring the factorization of N= 15 and N= 21. A simplified three-qubit circuit is found to successfully factor both cases when the testing integer numbers are appropriately chosen.

•Jan 1, 2025•0 citations
Shor's algorithm is one of the most prominent quantum algorithms, yet finding efficient implementations remains an active research challenge. While many approaches focus on low-level modular arithmetic optimizations, a broader perspective can provide additional opportunities for improvement. By adopting a mid-level abstraction, we analyze the algorithm as a sequence of computational tasks, enabling systematic identification of idle time and optimization of execution flow. Building on this perspective, we first introduce an alternating design approach to minimize idle time while preserving qubit efficiency in Shor's algorithm. By strategically reordering tasks for simultaneous execution, we achieve a substantial reduction in overall execution time. Extending this approach to distributed implementations, we demonstrate how task rearrangement enhances execution efficiency in the presence of multiple distribution channels. Furthermore, to effectively evaluate the impact of design choices, we employ static timing analysis (STA)—a technique from classical circuit design—to analyze circuit delays while accounting for hardware-specific execution characteristics, such as measurement and reset delays in monolithic architectures and ebit generation time in distributed settings. Finally, we validate our approach by integrating modular exponentiation circuits from QRISP and constructing circuits for factoring numbers up to 64 bits. Through an extensive study across neutral atom, superconducting, and ion trap quantum computing platforms, we analyze circuit delays, highlighting trade-offs between qubit efficiency and execution time. Our findings provide a structured framework for optimizing compiled quantum circuits for Shor's algorithm, tailored to specific hardware constraints.
Quantum computers leverage the principles of quantum mechanics to solve complex problems beyond the capabilities of classical computers, such as prime factorization, which poses a significant threat to cryptographic algorithms like RSA and ECC. Although current quantum resources are insufficient for effective decryption, ongoing research focuses on optimizing Shor's algorithm to overcome these limitations. Shor's algorithm, a quantum algorithm designed for efficient integer factorization, exploits quantum parallelism and entanglement to perform prime factorization exponentially faster than classical algorithms. This paper reviews recent trends in Shor algorithm optimization, particularly in enhancing the efficiency of ripple-carry operators and the Karatsuba algorithm in multiplication and proposes a multiplication method that applies the Strassen algorithm to constant adders