Fast Quantum Modular Exponentiation

R. Van Meter, K. M. Itoh · 2005 · arXiv 预印本（Phys. Rev. A 71, 052320）

| 编号 QEXP013 | 主题 模幂与 Shor | 链接 arXiv:quant-ph/0408006 |

摘要

摘要保留原文（英文）

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

We present a detailed analysis of the impact on modular exponentiation of architectural features and possible concurrent gate execution. Various arithmetic algorithms are evaluated for execution time, potential concurrency, and space tradeoffs. We find that, to exponentiate an n-bit number, for storage space 100n (twenty times the minimum 5n), we can execute modular exponentiation two hundred to seven hundred times faster than optimized versions of the basic algorithms, depending on architecture, for n=128. Addition on a neighbor-only architecture is limited to O(n) time when non-neighbor architectures can reach O(log n), demonstrating that physical characteristics of a computing device have an important impact on both real-world running time and asymptotic behavior. Our results will help guide experimental implementations of quantum algorithms and devices.

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