How to factor 2048 bit RSA integers with less than a million noisy qubits

Craig Gidney · 2025 · arXiv:2505.15917

| 编号 QE316 | 主题 容错协议 | 链接 arXiv:2505.15917 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

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 R

本站词条在引用该文献时，会以 wikilink（sources/QE316）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。