Planning the transition to quantum-safe cryptosystems requires understanding the cost of quantum attacks on vulnerable cryptosystems. In Gidney+Ekerå 2019, I co-published an estimate stating that 2048 bit RSA integers could be factored in eight hours by a quantum computer with 20 million noisy qubits. In this paper, I substantially reduce the number of qubits required. I estimate that a 2048 bit RSA integer could be factored in less than a week by a quantum computer with less than a million noisy qubits. I make the same assumptions as in 2019: a square grid of qubits with nearest neighbor connections, a uniform gate error rate of $0.1\%$, a surface code cycle time of 1 microsecond, and a control system reaction time of $10$ microseconds.
The qubit count reduction comes mainly from using approximate residue arithmetic (Chevignard+Fouque+Schrottenloher 2024), from storing idle logical qubits with yoked surface codes (Gidney+Newman+Brooks+Jones 2023), and from allocating less space to magic state distillation by using magic state cultivation (Gidney+Shutty+Jones 2024). The longer runtime is mainly due to performing more Toffoli gates and using fewer magic state factories compared to Gidney+Ekerå 2019. That said, I reduce the Toffoli count by over 100x compared to Chevignard+Fouque+Schrottenloher 2024.
Integer Factorization via Tensor Network Schnorr's Sieving
Università degli Studi di Padova(帕多瓦大学);INFN, Sezioni di Padova & Bari(意大利国家核物理研究所帕多瓦与巴里分部);Padua Quantum Technologies Research Center(帕多瓦量子技术中心);Institute for Complex Quantum Systems, Ulm University(乌尔姆大学复杂量子系统研究所);Dipartimento di Fisica e Astronomia “G. Galilei”(伽利略物理与天文学系);Dipartimento di Fisica, Università di Bari(巴里大学物理系)
Practical Challenges in Executing Shor's Algorithm on Existing Quantum Platforms
armasuisse Science and Technology, Cyber-Defence Campus(瑞士联邦国防部武器局科学与技术部,网络防御校区);ETH Zurich, Department of Computer Science(苏黎世联邦理工学院,计算机系);Paul Scherrer Institute, ETH Zurich–PSI Quantum Computing Hub(保罗谢尔研究所,苏黎世联邦理工学院-PSI量子计算中心)
Protecting Quantum Computers against Untrusted Users
Joint Center for Quantum Information and Computer Science, University of Maryland and NIST(马里兰大学与美国国家标准与技术研究院联合量子信息与计算中心);Electrical & Computer Engineering Department, The University of California, Los Angeles(加州大学洛杉矶分校电气与计算机工程系);DIENS, École Normale Supérieure, PSL University, CNRS, INRIA(巴黎高等师范学院、PSL大学、法国国家科学研究中心、法国国家信息与自动化研究所联合信息系);QuEra Computing Inc.(QuEra计算公司);QuEra Computing UK Ltd.(QuEra计算英国有限公司)