Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor
Abstract
Shor's algorithm is one of the most promising applications of quantum computers. However, since physical qubits are believed to be required for established approaches, the algorithm will need to be distributed across many modules. In this paper, we provide a distributed compilation of Shor's algorithm on a modular atomic processor. We present an end-to-end compilation and optimization strategy that focuses on the interplay between the inter-module communication and the intra-module clock rate. With a half-million-qubit modular atomic processor with a communication rate of Bell pairs per second and a measurement time of 1 ms in a CPU-inspired architecture, we demonstrate that 2048-bit RSA integers can be factored in only 16\% more time than a single-module architecture. Our work presents the first end-to-end analysis and simulation of large-scale integer factorization on modular atomic hardware and it provides a blueprint for the future design of other large-scale modular algorithms.
Cite
@article{arxiv.2605.03951,
title = {Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor},
author = {Tian Xue and Jacob P. Covey},
journal= {arXiv preprint arXiv:2605.03951},
year = {2026}
}