Fast quantum modular exponentiation

研究成果: Article査読

103 被引用数 (Scopus)

抄録

We present a detailed analysis of the impact on quantum modular exponentiation of architectural features and possible concurrent gate execution. Various arithmetic algorithms are evaluated for execution time, potential concurrency, and space trade-offs. We find that to exponentiate an n-bit number, for storage space 100n (20 times the minimum 5n), we can execute modular exponentiation 200-700 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, whereas non-neighbor architectures can reach O(logn), 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.

本文言語English
論文番号052320
ジャーナルPhysical Review A - Atomic, Molecular, and Optical Physics
71
5
DOI
出版ステータスPublished - 2005 5

ASJC Scopus subject areas

  • 原子分子物理学および光学

フィンガープリント

「Fast quantum modular exponentiation」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル