How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits

Craig Gidney, Martin Ekerå · 2021 · Quantum 5, 433 (2021)

| 编号 QE308 | 主题 容错协议 | 链接 arXiv:1905.09749 |

摘要

摘要保留原文（英文）

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

We significantly reduce the cost of factoring integers and computing discrete logarithms in finite fields on a quantum computer by combining techniques from Shor 1994, Griffiths-Niu 1996, Zalka 2006, Fowler 2012, Ekerå-Håstad 2017, Ekerå 2017, Ekerå 2018, Gidney-Fowler 2019, Gidney 2019. We estimate the approximate cost of our construction using plausible physical assumptions for large-scale super

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