Shor’s algorithm is possible with as few as 10,000 reconfigurable atomic qubits

Madelyn Cain et al. · 2026 · arXiv

| 编号 QE376 | 主题 硬件实验与里程碑 | 链接 arXiv:2603.28627 |

摘要

摘要保留原文（英文）

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

Quantum computers have the potential to perform computational tasks beyond the reach of classical machines. A prominent example is Shor’s algorithm for integer factorization and discrete logarithms, which is of both fundamental importance and practical relevance to cryptography. However, due to the high overhead of quantum error correction, optimized resource estimates for cryptographically relevant instances of Shor’s algorithm require millions of physical qubits. Here, by leveraging advances in high-rate quantum error-correcting codes, efficient logical instruction sets, and circuit design, we show that Shor’s algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits. Increasing the number of physical qubits improves time efficiency by enabling greater parallelism; under plausible assumptions, the runtime for discrete logarithms on the P-256 elliptic curve could be just a few days for a system with 26,000 physical qubits, while the runtime for factoring RSA-2048 integers is one to two orders of magnitude longer. Recent neutral-atom experiments have demonstrated universal fault-tolerant operations below the error-correction t

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