arXiv:2505.16163 · Physical Review A

Improving adiabatic quantum factorization via chopped random-basis optimization

Tianlai Yang, Mo Xiong, Ming Xue, Xinwei Li, Jinbin Li

Published May 19, 2025• 0 citations

Abstract

Integer factorization remains a significant challenge for classical computers and is fundamental to the security of RSA encryption. Adiabatic quantum algorithms present a promising solution, yet their practical implementation is limited by the short coherence times of current noisy intermediate-scale quantum devices and quantum simulators. In this work, we apply the chopped random-basis (CRAB) optimization technique to enhance adiabatic quantum factorization algorithms. We demonstrate the effectiveness of CRAB by applying it to factor the integers ranging from 21 to 2479, achieving significantly improved fidelity of the target state when the evolution time exceeds the quantum speed limit. Notably, this performance improvement shows resilience in the presence of dephasing noise, highlighting CRAB's practical utility in noisy quantum systems. Our findings suggest that CRAB optimization can serve as a powerful tool for advancing adiabatic quantum algorithms, with broader implications for quantum information processing tasks.

DOI: 10.1103/physreva.111.052617

Related papers

Chopped random-basis quantum optimization

Tommaso Caneva, Tommaso Calarco, Simone Montangero

In this work, we describe in detail the chopped random basis (CRAB) optimal control technique recently introduced to optimize time-dependent density matrix renormalization group simulations [P. Doria, T. Calarco, and S. Montangero, Phys. Rev. Lett. 106, 190501 (2011)]. Here, we study the efficiency of this control technique in optimizing different quantum processes and we show that in the considered cases we obtain results equivalent to those obtained via different optimal control methods while using less resources. We propose the CRAB optimization as a general and versatile optimal control technique.

arXiv:1103.0855Physical Review AAug 22, 2011400 citations

Adiabatic population transfer of dressed spin states with quantum optimal control

Shu-Hao Wu, Mayra Amezcua, Hailin Wang

We report theoretical studies of adiabatic population transfer using dressed spin states. Quantum optimal control using the chopped random basis (CRAB) algorithm has been implemented in a negatively charged diamond nitrogen vacancy center that is coupled to a strong and resonant microwave field. We show that the dressed spin states are highly effective in suppressing effects of spin dephasing on adiabatic population transfer. The numerical simulation also demonstrates that CRAB-based quantum optimal control can enable an efficient and robust adiabatic population transfer.

arXiv:1903.12651Physical Review AJun 10, 201914 citations

Optimal Control of two-level quantum systems via Chopped RAndom Basis algorithm

Luna Cesari

This work is devoted to the study and the application of the Chopped RAndomBasis (CRAB) control algorithm as an efficient, versatile optimal control techniqueto be used for the purpose of enhancing the quality of quantum processes. In orderto show its principal aspects, the method is here applied to different systems, inparticular one-qubit and two-qubit system. Finally, the dressed CRAB algorithmis presented as a valid alternative to the standard method, as it comes with theadditional property of guaranteed convergence to the global optimum

Mar 1, 20200 citations

Enhancing the Practical Reliability of Shor's Quantum Algorithm via Generalized Period Decomposition: Theory and Large-Scale Empirical Validation

Chih-Chen Liao, Chia-Hsin Liu, Yun-Cheng Tsai

This work presents a generalized period decomposition approach, significantly improving the practical reliability of Shor's quantum factoring algorithm. Although Shor's algorithm theoretically enables polynomial-time integer factorization, its real-world performance heavily depends on stringent conditions related to the period obtained via quantum phase estimation. Our generalized decomposition method relaxes these conditions by systematically exploiting arbitrary divisors of the obtained period, effectively broadening the applicability of each quantum execution. Extensive classical simulations were performed to empirically validate our approach, involving over one million test cases across integers ranging from 2 to 8 digits. The proposed method achieved near-perfect success rates, exceeding 99.998% for 7-digit numbers and 99.999% for 8-digit numbers, significantly surpassing traditional and recently improved variants of Shor's algorithm. Crucially, this improvement is achieved without compromising the algorithm's polynomial-time complexity and integrates seamlessly with existing quantum computational frameworks. Moreover, our method enhances the efficiency of quantum resource usage by minimizing unnecessary repetitions, making it particularly relevant for quantum cryptanalysis with noisy intermediate-scale quantum (NISQ) devices. This study thus provides both theoretical advancements and substantial practical benefits, contributing meaningfully to the field of quantum algorithm research and the broader field of quantum information processing.

quant-pharXiv:2512.11004Dec 12, 20250 citations

Integer Factorization through Func-QAOA

Mostafa Atallah, Haemanth Velmurugan, Rohan Sharma +5 more

Integer factorization is a significant problem, with implications for the security of widely-used cryptographic schemes. No efficient classical algorithm for polynomial-time integer factorization has been found despite extensive research. Although Peter Shor's breakthrough quantum algorithm offers a viable solution, current limitations of noisy intermediate-scale quantum (NISQ) computers hinder its practical implementation. To address this, researchers have explored alternative methods for factorization suitable for NISQ devices. One such method is the Quantum Approximate Optimization Algorithm, which treats factoring as an optimization problem defined over binary bits, resulting in various problematic aspects. In this paper, we explore the Func-QAOA approach for factorization, which premises overcoming some of the limitations of previous approaches and allows the incorporation of more advanced factorization techniques. After reviewing the most promising quantum implementations for integer arithmetics, we present a few illustrative examples to demonstrate the efficacy of the Func-QAOA approach and discuss methods to reduce the search space to speed up the optimization process.

arXiv:2309.15162Sep 26, 20230 citations

Optimizing control fields for adiabatic protocols in the presence of noise

Marllos E. F. Fernandes, Emanuel F. de Lima, L. K. Castelano

Quantum control techniques are employed to perform adiabatic quantum computing in the presence of noise. First, we analyze the adiabatic entanglement protocol (AEP) for two qubits. In this case, we found that this protocol is very robust against noise. The reason behind this fact is related to the chosen Hamiltonians, where the ground state of the initial Hamiltonian is not affected by the noise. The optimal control solution, in this case, is to leave the system in its ground state and apply a fast pulse to entangle the qubits at the end of the time evolution. Secondly, we probe a system composed of three qubits, where the goal is to teleport the first qubit to the third qubit. In this case, the ground state of the system does not share the same robustness against noise as in the case of AEP. To improve the robustness against noise, we propose the inclusion of a local control field that can drive the system to an intermediate state, which is more robust against noise in comparison to other states. The target state is also achieved by a fast pulse at the final time. We found that this approach provides a significant gain in the fidelity and can improve the adiabatic quantum computing in the so-called Noisy Intermediate-Scale Quantum (NISQ) devices in a near future.

arXiv:2306.07269Jun 12, 20230 citations