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

Implementation and Analysis of Scalability of Quantum Algorithms Based on Circuits and Subroutines

María Luisa Rodríguez Castillo

Published Jan 21, 2026• 0 citations
OpenAlex

Abstract

Quantum computing has given rise to significant challenges that make its wide availability difficult, especially when it comes to the accurate calculation of execution costs of Quantum Runtime Services, which in turn complicates the ability of a programmer to take well-informed decisions given an expectation of both cost and success rates. Quantum algorithms are intertwined in a complex web of dependencies, in which modern algorithms commonly incorporate other algorithms as subroutines. This paper studies whether the characterization of success metrics in scaling scenarios of specific quantum subroutines can be extrapolated to the quantum algorithms that integrate them as subroutines. It focuses on Shor’s algorithm, and the Quantum Fourier Transform algorithm as a subroutine, analyzing possible correlations in different scaling scenarios created by modifying the input parameters ’N’ and ’a’, running three jobs with different noise models for each one. The results showed a clear correlation that closely resembles a 2:1 ratio for the circuit where N = 15. For N = 15 circuits, success rates varied significantly, only reflecting ratios close to 2:1 when the period was equal to 2, an ideal, small and even number that reduced the required operations of the modular exponentiation stage. Larger periods such as r = 6 showed lesser success rates due to the necessity of performing more operations during the modular exponentiation stage and the noise accumulation it entails. Results achieved in high noise conditions had similar Shor and QFT success rates, evidencing how the dispersion of shots can alter the expected results. There is a meaningful connection between the success rates of an algorithm and its subroutine, which can be shadowed or decreased when error rates and qubit counts are increased.

Related papers

Deconstructing Shor’s Algorithm Using Quantum Fourier Transform

Dushyant Kumar, Balwinder Raj, Gurmohan Singh

Shor's algorithm proved a significant milestone in quantum computing since it promises an exponential speedup over conventional algorithms for integer factorization, a problem critical to modern cryptography systems. This work covers implementation steps of Shor’s algorithm and analyzes Quantum Fourier Transform (QFT) usage for extracting periodicity from quantum superpositions. Firstly, theoretical foundations of algorithm are illustrated concentrating on QFT construction and operation within the setting of the quantum circuit. Thereafter, each implementation step such as qubit optimization, modular exponentiation, and circuit design is discussed. Our findings validate the theoretical effectiveness of the QFT in solving the period-finding subroutine, while also highlighting the practical difficulties and scaling constraints presented by existing quantum hardware. The paper ends with a summary of possible advancements and future paths for error mitigation strategies and quantum algorithm design.

Indian Journal of Pure & Applied Physics•Jan 1, 2026•0 citations

An exploration of the noise sensitivity of the Shor's algorithm

Fusheng Yang, Zhipeng Liang, Zhengzhong Yi +1 more

Quantum algorithms face significant challenges due to qubit susceptibility to environmental noise, and quantum error correction typically requires prohibitive resource overhead. This paper proposes that quantum algorithms may possess inherent noise resilience characteristics that could reduce implementation barriers. We investigate Shor's algorithm by applying circuit-level noise models directly to the original algorithm circuit. Our findings reveal that Shor's algorithm demonstrates superior fault tolerance under Z noise compared to X and Y noise. Focusing on the modular exponentiation circuit which is the core component of the algorithm, we conduct fault-tolerant position statistics on circuits with bit lengths from 4 to 9. The results show that under Z noise, fault-tolerant positions grow with the same quartic polynomial order as potential error positions as the problem scale increases. In contrast, fault tolerance under X and Y noise exhibits a strong dependence on the composite number N and the parameter a. Based on these findings, we develop an extrapolation method predicting that the minimum probability of a correct output of the modular exponentiation circuit to factor 2048 bit integers under biased noise is approximately 1.417*{10}^{-17}.

arXiv:2509.00417•Aug 30, 2025•0 citations

Quantum Algorithms and their Implementation on Quantum Computer Simulators

Mike van der Lans

Quantum computation is becoming an increasingly interesting field, especially with the rise of real quantum computers. However, current quantum processors contain a few tens of error-prone qubits and the realization of large-scale quantum computers is still very challenging. Therefore, quantum computer simulators are particularly suitable for testing and analysing quantum algorithms without having a real quantum computer at one's disposal. In this thesis, different quantum algorithms such as Grover's and Shor's algorithm as well as key quantum routines such as the Quantum Fourier Transform (QFT) and a quantum adder/subtractor are described and analysed (optimal number of iterations, time complexity). Some of them have been implemented for an arbitrary number of qubits and have been simulated using two different quantum simulators, the QX simulator developed at QuTech and the Liquid simulator from Microsoft. In addition, how errors affect the success rate of the algorithms has been investigated.

•Jan 1, 2018•0 citations

Performance Evaluation of Shor Algorithm on Simulated Quantum Hardware with Circuit Level Analysis

T. Thamaraimanalan, Anandakumar Haldorai, Arulmurugan Ramu +1 more

Shor’s algorithm stands as a breakthrough in quantum computing due to its potential to factor large integers exponentially quicker than classical algorithms. However, implementing and evaluating this algorithm on real quantum computer hardware remains exciting due to qubit limitations, gate noise, and hardware constraints. This research presents a comprehensive performance evaluation of Shor’s algorithm using simulated quantum backends provided by Qiskit. A flexible and generic implementation is proposed, allowing dynamic input of integers to be factored, with randomized co-prime selection and automated circuit generation. The algorithm is tested on various semiprime numbers, such as 15, 21, and 35, using IBM’s Aer simulator. A major contribution of this work is the circuit-level analysis conducted both before and after transpilation. Metrics such as gate counts, circuit depth, and simulator runtime are extracted to assess scalability and resource requirements. High-resolution plots of the pre-transpiled circuits are saved to visualize algorithmic complexity, while post-transpilation metrics inform future quantum hardware feasibility. The output measurement distributions are analyzed to estimate periodicity and derive correct factors. The proposed implementation is compared with existing fixed-instance Shor demonstrations to highlight its flexibility and extensibility. Experimental results show consistent success in factor retrieval and provide valuable insight into circuit growth and complexity under realistic constraints. This analysis lays the groundwork for future adaptation to NISQ hardware and contributes to understanding Shor’s algorithm from both computational and architectural perspectives.

Journal of Machine and Computing•Jul 2, 2025•3 citations

Scalable Quantum Algorithms for Noisy Quantum Computers

Julien Gacon

Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. Access to a computational space that incorporates quantum effects, such as superposition and entanglement, enables the derivation of promising quantum algorithms for important tasks, including preparing the ground state of a quantum system or predicting its evolution over time. Successfully tackling these tasks promises insights into significant theoretical and technological questions, such as superconductivity and the design of new materials. The aim of quantum algorithms is to use a series of quantum operations in a quantum circuit to solve a problem beyond the reach of classical computers. However, the noise and limited scale of current quantum computers restricts these circuits to moderate sizes and depths. As a result, many prominent algorithms are currently infeasible to run for problem sizes of practical interest. In response, recent research focused on variational quantum algorithms, which allow the selection of circuits that act within a quantum device's capabilities. Yet, these algorithms can require the execution of a large number of circuits, leading to prohibitively long computation times. This doctoral thesis develops two main techniques to reduce these quantum computational resource requirements, with the goal of scaling up application sizes on current quantum processors. The first approach is based on stochastic approximations of computationally costly quantities, such as quantum circuit gradients or the quantum geometric tensor (QGT). The second method takes a different perspective on the QGT, leading to a potentially more efficient description of time evolution on current quantum computers. Both techniques rely on maintaining available information and only computing necessary corrections, instead of re-computing possibly redundant data. The main focus of application for our algorithms is the simulation of quantum systems, broadly defined as including the preparation of ground and thermal states, and the real- and imaginary-time propagation of a system. The developed subroutines, however, can further be utilized in the fields of optimization or machine learning. Our algorithms are benchmarked on a range of representative models, such as Ising or Heisenberg spin models, both in numerical simulations and experiments on the hardware. In combination with error mitigation techniques, the latter is scaled up to 27 qubits; into a regime that variational quantum algorithms are challenging to scale to on noisy quantum computers without our algorithms.

arXiv:2403.00940•Jan 1, 2024•7 citations

A Key Component of the Shor's Algorithm and Its Possible Quantum Implementations

Jiří Tomčala

A fundamental problem in factorization by Shor's algorithm [1] is the implementation of the modular exponentiation function. The period of this function is important for determining the individual factors, so its accurate implementation is for successful factorization critical.The imprecision of current quantum computers requires that any quantum circuits should be as simple as possible. Both in terms of the number of qubits used, the number of quantum gates and the depth of the quantum circuit. Therefore, it is necessary to search for an optimal variant for the implementation of the above-mentioned modular exponentiation function.The standard method is to implement individual arithmetic functions [2] which can be combined to achieve the desired modular exponentiation function. This process, however, creates a very complex quantum circuit, so that its measured result (probability distribution) will be so skewed that it will not be possible to reliably obtain the period of sought.Another way is to create a special quantum circuit for one particular modular exponentiation function [3]. Such a circuit is of course simpler than the circuit created by the above universal implementation, but in practice it only makes sense for testing the functionality of the surrounding quantum circuit for period detection.A very interesting possibility for the implementation of arithmetic functions is to use the direct and inverse quantum Fourier transform [4]. For a quantum computer, these transformations are very easy operations, and this interesting feature can then be used to advantage in these various implementations.This contribution will explore these possible approaches and show their advantages and disadvantages through concrete examples.

•Dec 17, 2025•0 citations
Quantum computing has given rise to significant challenges that make its wide availability difficult, especially when it comes to the accurate calculation of execution costs of Quantum Runtime Services, which in turn complicates the ability of a programmer to take well-informed decisions given an expectation of both cost and success rates. Quantum algorithms are intertwined in a complex web of dependencies, in which modern algorithms commonly incorporate other algorithms as subroutines. This paper studies whether the characterization of success metrics in scaling scenarios of specific quantum subroutines can be extrapolated to the quantum algorithms that integrate them as subroutines. It focuses on Shor’s algorithm, and the Quantum Fourier Transform algorithm as a subroutine, analyzing possible correlations in different scaling scenarios created by modifying the input parameters ’N’ and ’a’, running three jobs with different noise models for each one. The results showed a clear correlation that closely resembles a 2:1 ratio for the circuit where N = 15. For N = 15 circuits, success rates varied significantly, only reflecting ratios close to 2:1 when the period was equal to 2, an ideal, small and even number that reduced the required operations of the modular exponentiation stage. Larger periods such as r = 6 showed lesser success rates due to the necessity of performing more operations during the modular exponentiation stage and the noise accumulation it entails. Results achieved in high noise conditions had similar Shor and QFT success rates, evidencing how the dispersion of shots can alter the expected results. There is a meaningful connection between the success rates of an algorithm and its subroutine, which can be shadowed or decreased when error rates and qubit counts are increased.
Shor's algorithm proved a significant milestone in quantum computing since it promises an exponential speedup over conventional algorithms for integer factorization, a problem critical to modern cryptography systems. This work covers implementation steps of Shor’s algorithm and analyzes Quantum Fourier Transform (QFT) usage for extracting periodicity from quantum superpositions. Firstly, theoretical foundations of algorithm are illustrated concentrating on QFT construction and operation within the setting of the quantum circuit. Thereafter, each implementation step such as qubit optimization, modular exponentiation, and circuit design is discussed. Our findings validate the theoretical effectiveness of the QFT in solving the period-finding subroutine, while also highlighting the practical difficulties and scaling constraints presented by existing quantum hardware. The paper ends with a summary of possible advancements and future paths for error mitigation strategies and quantum algorithm design.
Quantum algorithms face significant challenges due to qubit susceptibility to environmental noise, and quantum error correction typically requires prohibitive resource overhead. This paper proposes that quantum algorithms may possess inherent noise resilience characteristics that could reduce implementation barriers. We investigate Shor's algorithm by applying circuit-level noise models directly to the original algorithm circuit. Our findings reveal that Shor's algorithm demonstrates superior fault tolerance under Z noise compared to X and Y noise. Focusing on the modular exponentiation circuit which is the core component of the algorithm, we conduct fault-tolerant position statistics on circuits with bit lengths from 4 to 9. The results show that under Z noise, fault-tolerant positions grow with the same quartic polynomial order as potential error positions as the problem scale increases. In contrast, fault tolerance under X and Y noise exhibits a strong dependence on the composite number N and the parameter a. Based on these findings, we develop an extrapolation method predicting that the minimum probability of a correct output of the modular exponentiation circuit to factor 2048 bit integers under biased noise is approximately 1.417*{10}^{-17}.
Quantum computation is becoming an increasingly interesting field, especially with the rise of real quantum computers. However, current quantum processors contain a few tens of error-prone qubits and the realization of large-scale quantum computers is still very challenging. Therefore, quantum computer simulators are particularly suitable for testing and analysing quantum algorithms without having a real quantum computer at one's disposal. In this thesis, different quantum algorithms such as Grover's and Shor's algorithm as well as key quantum routines such as the Quantum Fourier Transform (QFT) and a quantum adder/subtractor are described and analysed (optimal number of iterations, time complexity). Some of them have been implemented for an arbitrary number of qubits and have been simulated using two different quantum simulators, the QX simulator developed at QuTech and the Liquid simulator from Microsoft. In addition, how errors affect the success rate of the algorithms has been investigated.
Shor’s algorithm stands as a breakthrough in quantum computing due to its potential to factor large integers exponentially quicker than classical algorithms. However, implementing and evaluating this algorithm on real quantum computer hardware remains exciting due to qubit limitations, gate noise, and hardware constraints. This research presents a comprehensive performance evaluation of Shor’s algorithm using simulated quantum backends provided by Qiskit. A flexible and generic implementation is proposed, allowing dynamic input of integers to be factored, with randomized co-prime selection and automated circuit generation. The algorithm is tested on various semiprime numbers, such as 15, 21, and 35, using IBM’s Aer simulator. A major contribution of this work is the circuit-level analysis conducted both before and after transpilation. Metrics such as gate counts, circuit depth, and simulator runtime are extracted to assess scalability and resource requirements. High-resolution plots of the pre-transpiled circuits are saved to visualize algorithmic complexity, while post-transpilation metrics inform future quantum hardware feasibility. The output measurement distributions are analyzed to estimate periodicity and derive correct factors. The proposed implementation is compared with existing fixed-instance Shor demonstrations to highlight its flexibility and extensibility. Experimental results show consistent success in factor retrieval and provide valuable insight into circuit growth and complexity under realistic constraints. This analysis lays the groundwork for future adaptation to NISQ hardware and contributes to understanding Shor’s algorithm from both computational and architectural perspectives.
Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. Access to a computational space that incorporates quantum effects, such as superposition and entanglement, enables the derivation of promising quantum algorithms for important tasks, including preparing the ground state of a quantum system or predicting its evolution over time. Successfully tackling these tasks promises insights into significant theoretical and technological questions, such as superconductivity and the design of new materials. The aim of quantum algorithms is to use a series of quantum operations in a quantum circuit to solve a problem beyond the reach of classical computers. However, the noise and limited scale of current quantum computers restricts these circuits to moderate sizes and depths. As a result, many prominent algorithms are currently infeasible to run for problem sizes of practical interest. In response, recent research focused on variational quantum algorithms, which allow the selection of circuits that act within a quantum device's capabilities. Yet, these algorithms can require the execution of a large number of circuits, leading to prohibitively long computation times. This doctoral thesis develops two main techniques to reduce these quantum computational resource requirements, with the goal of scaling up application sizes on current quantum processors. The first approach is based on stochastic approximations of computationally costly quantities, such as quantum circuit gradients or the quantum geometric tensor (QGT). The second method takes a different perspective on the QGT, leading to a potentially more efficient description of time evolution on current quantum computers. Both techniques rely on maintaining available information and only computing necessary corrections, instead of re-computing possibly redundant data. The main focus of application for our algorithms is the simulation of quantum systems, broadly defined as including the preparation of ground and thermal states, and the real- and imaginary-time propagation of a system. The developed subroutines, however, can further be utilized in the fields of optimization or machine learning. Our algorithms are benchmarked on a range of representative models, such as Ising or Heisenberg spin models, both in numerical simulations and experiments on the hardware. In combination with error mitigation techniques, the latter is scaled up to 27 qubits; into a regime that variational quantum algorithms are challenging to scale to on noisy quantum computers without our algorithms.
A fundamental problem in factorization by Shor's algorithm [1] is the implementation of the modular exponentiation function. The period of this function is important for determining the individual factors, so its accurate implementation is for successful factorization critical.The imprecision of current quantum computers requires that any quantum circuits should be as simple as possible. Both in terms of the number of qubits used, the number of quantum gates and the depth of the quantum circuit. Therefore, it is necessary to search for an optimal variant for the implementation of the above-mentioned modular exponentiation function.The standard method is to implement individual arithmetic functions [2] which can be combined to achieve the desired modular exponentiation function. This process, however, creates a very complex quantum circuit, so that its measured result (probability distribution) will be so skewed that it will not be possible to reliably obtain the period of sought.Another way is to create a special quantum circuit for one particular modular exponentiation function [3]. Such a circuit is of course simpler than the circuit created by the above universal implementation, but in practice it only makes sense for testing the functionality of the surrounding quantum circuit for period detection.A very interesting possibility for the implementation of arithmetic functions is to use the direct and inverse quantum Fourier transform [4]. For a quantum computer, these transformations are very easy operations, and this interesting feature can then be used to advantage in these various implementations.This contribution will explore these possible approaches and show their advantages and disadvantages through concrete examples.