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

A Reproducible Walk-Through of RSA, Classical Factoring, and Shor's Algorithm on IBM Heron r2 Hardware

Mark Lester Dampios

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.13140/rg.2.2.28408.40965

Related papers

The Cruicality of Shor's Algorithm In Breaking RSA Encryption

Bilisuma Merga

•Jan 1, 2024•1 citation

Shor’s Algorithm on NISQ Quantum Hardware: Experimental 4–12-Bit Factorizations and Post-Quantum Cryptography Implications

Wael M. F. Abdel-Rehim

Shor's quantum factoring algorithm threatens RSA and elliptic-curve cryptography, yet the operational limits of noisy intermediate-scale quantum (NISQ) hardware for complete Shor implementations remain poorly characterized. This paper presents the first systematic experimental evaluation of the full QFT-based Shor period-finding circuit — with base a and period r pre-selected classically but the complete inverse-QFT structure fully preserved on hardware — across nine semiprimes ranging from 4 to 12 bits, executed on IBM 156-qubit Heron-class processors. All nine instances were factored successfully, including the first reported 8–12-bit superconducting results: N = 205 (61.5%) through N = 3427 (73.4%). The central finding is that QFT peak separability (ΔK) dominates success probability (R2= 0.94), while transpilation overhead is essentially irrelevant (R2= 0.06). Period r = 4 emerges as a noise-robust configuration at 8–12-bit scale, with ΔK ≥ 8 defining the practical NISQ threshold. Six quantitative design rules enable systematic instance pre-screening, with implications for post-quantum cryptography migration timelines discussed.

ICEENG International Conference for Innovations in Intelligent Computing and Cybersecurity (IICC)•May 11, 2026•0 citations

A Guided Quantum Walk Solver for Portfolio Optimization: Circuit Implementation, Warm-Start Initialization, and Hardware Execution on IBM Heron R2

Farhan K A, Raghavan G

Abstract Recent research on quantum walk-based optimization has shown theoretical potential as an alternative to variational algorithms, avoiding local minima entrapment or barren plateaus by utilizing physically motivated structure rather than unconstrained parameter search. Despite this, the Guided Quantum Walk (GQW) has never been used for portfolio optimization or tested on existing noisy quantum hardware. In this paper we propose a hybrid quantum-classical solver for portfolio optimization that integrates Guided Quantum Walks (GQW) with domain-specific knowledge elicited from real Indian equity data. The core technical contributions are threefold. First, we implement a parameterized GQW circuit in Qiskit (v2.2) with a B\'{e}zier-curve-parameterized hopping rate schedule, mapping the portfolio selection problem directly to the GQW Hilbert space via an Ising Hamiltonian encoding. Second, we introduce a problem-aware warm-start strategy that initializes the energy scale parameters from classical sampling of the feasible portfolio subspace, bypassing the high-energy exploration phase that characterizes naive initialization. Third, we incorporate Conditional Value-at-Risk (CVaR) aggregation into the quantum walk measurement to improve solution space sampling, as well as a hardware-adaptive pipeline that adjusts concentration to per-backend circuit fidelity for IBM Heron devices.\\Our simulation results demonstrate near-optimal approximation ratios exceeding 0.99 for problem sizes up to N=20 on a noiseless setting with CVaR concentration \(((\alpha \in \{0.1,0.25\}))\), significantly outperforming standard energy expectation values \(((\alpha=1.0))\). Hardware validation on IBM Heron R2 processors, confirms that parameters optimized on noiseless simulation transfer effectively to real devices without re-optimization, with median approximation ratios above 0.85 across all backends for N=12 drawn from live NIFTY 50 market data. This constitutes the first end-to-end GQW implementation for financial portfolio optimization using IBM quantum hardware, and its application as a scalable quantum solver for real-world financial decision support systems.

•May 22, 2026•0 citations

Breaking Integer Factorization Using Shor’s Algorithm: A Practical Approach with IBM Qiskit

Anand Ghugare, Atharva Rajoba, Dinesh Kumar Saini

Smart innovation, systems and technologies•Jan 1, 2026•0 citations

Shor's Algorithm: Factoring and Cryptanalysis

Bhupendra Singh, Mohankumar Mylsamy, Thamaraimanalan Thangarajan

“Shor's Algorithm: Factoring and Cryptanalysis” focuses on Shor's Algorithm, particularly its application to factoring and cryptanalysis. It begins with an overview of Shor's algorithm, detailing the classical extraction of periods from measured values and the quantum gates required for the Quantum Fourier Transform (QFT). Further, this chapter explores the applications and limitations of Shor's algorithm, including its impact on RSA encryption. A literature review follows, discussing Shor's algorithm in the context of quantum computation, its effectiveness on RSA, and the effects of imperfections on its factorization process. The section also includes an experimental study of Shor's algorithm using IBM Q, followed by a practical implementation of factoring numbers N=21 and N=35. Further, it covers resource estimation, quantum simulations, and different types of simulators in IBM Qiskit, including state vector, QASM, Matrix Product State (MPS), and stabilizer simulators, providing insights into their use cases and the limits of classical simulation.

CRC Press eBooks•Nov 14, 2025•0 citations

A precise estimation of the computational complexity in Shor's factoring algorithm

憲 栗山, S. Sano, S. Furuichi

•Jan 1, 2007•0 citations
Shor's quantum factoring algorithm threatens RSA and elliptic-curve cryptography, yet the operational limits of noisy intermediate-scale quantum (NISQ) hardware for complete Shor implementations remain poorly characterized. This paper presents the first systematic experimental evaluation of the full QFT-based Shor period-finding circuit — with base a and period r pre-selected classically but the complete inverse-QFT structure fully preserved on hardware — across nine semiprimes ranging from 4 to 12 bits, executed on IBM 156-qubit Heron-class processors. All nine instances were factored successfully, including the first reported 8–12-bit superconducting results: N = 205 (61.5%) through N = 3427 (73.4%). The central finding is that QFT peak separability (ΔK) dominates success probability (R2= 0.94), while transpilation overhead is essentially irrelevant (R2= 0.06). Period r = 4 emerges as a noise-robust configuration at 8–12-bit scale, with ΔK ≥ 8 defining the practical NISQ threshold. Six quantitative design rules enable systematic instance pre-screening, with implications for post-quantum cryptography migration timelines discussed.
Abstract Recent research on quantum walk-based optimization has shown theoretical potential as an alternative to variational algorithms, avoiding local minima entrapment or barren plateaus by utilizing physically motivated structure rather than unconstrained parameter search. Despite this, the Guided Quantum Walk (GQW) has never been used for portfolio optimization or tested on existing noisy quantum hardware. In this paper we propose a hybrid quantum-classical solver for portfolio optimization that integrates Guided Quantum Walks (GQW) with domain-specific knowledge elicited from real Indian equity data. The core technical contributions are threefold. First, we implement a parameterized GQW circuit in Qiskit (v2.2) with a B\'{e}zier-curve-parameterized hopping rate schedule, mapping the portfolio selection problem directly to the GQW Hilbert space via an Ising Hamiltonian encoding. Second, we introduce a problem-aware warm-start strategy that initializes the energy scale parameters from classical sampling of the feasible portfolio subspace, bypassing the high-energy exploration phase that characterizes naive initialization. Third, we incorporate Conditional Value-at-Risk (CVaR) aggregation into the quantum walk measurement to improve solution space sampling, as well as a hardware-adaptive pipeline that adjusts concentration to per-backend circuit fidelity for IBM Heron devices.\\Our simulation results demonstrate near-optimal approximation ratios exceeding 0.99 for problem sizes up to N=20 on a noiseless setting with CVaR concentration ((α∈{0.1,0.25}))((\alpha \in \{0.1,0.25\}))((α∈{0.1,0.25})), significantly outperforming standard energy expectation values ((α=1.0))((\alpha=1.0))((α=1.0)). Hardware validation on IBM Heron R2 processors, confirms that parameters optimized on noiseless simulation transfer effectively to real devices without re-optimization, with median approximation ratios above 0.85 across all backends for N=12 drawn from live NIFTY 50 market data. This constitutes the first end-to-end GQW implementation for financial portfolio optimization using IBM quantum hardware, and its application as a scalable quantum solver for real-world financial decision support systems.
“Shor's Algorithm: Factoring and Cryptanalysis” focuses on Shor's Algorithm, particularly its application to factoring and cryptanalysis. It begins with an overview of Shor's algorithm, detailing the classical extraction of periods from measured values and the quantum gates required for the Quantum Fourier Transform (QFT). Further, this chapter explores the applications and limitations of Shor's algorithm, including its impact on RSA encryption. A literature review follows, discussing Shor's algorithm in the context of quantum computation, its effectiveness on RSA, and the effects of imperfections on its factorization process. The section also includes an experimental study of Shor's algorithm using IBM Q, followed by a practical implementation of factoring numbers N=21 and N=35. Further, it covers resource estimation, quantum simulations, and different types of simulators in IBM Qiskit, including state vector, QASM, Matrix Product State (MPS), and stabilizer simulators, providing insights into their use cases and the limits of classical simulation.