arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0408006quant-ph
收藏

快速量子模幂

Fast Quantum Modular Exponentiation

R. Van Meter, K. M. Itoh

摘要:

我们提出了一个详细的分析,对模幂的架构功能和可能的并发门执行的影响。各种算术算法的执行时间,潜在的并发性和空间的权衡进行评估。我们发现,对于存储空间100 n(最小值5n的20倍),对n位数求幂,我们可以执行比基本算法的优化版本快200到700倍的模幂运算,具体取决于架构,对于n=128。当非邻居架构可以达到O(log n)时,仅邻居架构上的添加被限制为O(n)时间,这表明计算设备的物理特性对现实世界的运行时间和渐近行为都有重要影响。我们的研究结果将有助于指导量子算法和设备的实验实现。

英文摘要:

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.

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

↑