arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2505.15917quant-ph
收藏

如何用不到一百万个噪声量子比特分解2048位RSA整数

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

Craig Gidney

AI总结:

本文提出用不到一百万个噪声量子比特在不到一周内分解2048位RSA整数的方法,通过近似余数算术、轭式表面码和魔法态培育大幅减少量子比特需求,同时将Toffoli门数较先前工作降低百倍以上。

摘要:

规划向量子安全密码系统的过渡,需要理解量子攻击对易受攻击密码系统的成本。在Gidney+Ekerå 2019中,我合著发表了一项估计,声称2048位RSA整数可以在八小时内被一台拥有2000万个噪声量子比特的量子计算机分解。在本文中,我大幅减少了所需的量子比特数量。我估计,一台拥有不到一百万个噪声量子比特的量子计算机可以在不到一周的时间内分解2048位RSA整数。我做出与2019年相同的假设:一个具有最近邻连接的正方形量子比特网格,均匀门错误率为0.1%,表面码循环时间为1微秒,控制系统反应时间为10微秒。量子比特数量的减少主要来自于使用近似余数算术(Chevignard+Fouque+Schrottenloher 2024)、使用轭式表面码存储空闲逻辑量子比特(Gidney+Newman+Brooks+Jones 2023),以及通过使用魔法态培育(Gidney+Shutty+Jones 2024)分配更少的空间给魔法态蒸馏。更长的运行时间主要是由于执行更多的Toffoli门以及相比Gidney+Ekerå 2019使用更少的魔法态工厂。也就是说,与Chevignard+Fouque+Schrottenloher 2024相比,我将Toffoli门数量减少了超过100倍。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑