2004/08/31 by Rodney Van Meter, R. Van Meter, Kohei M. Itoh +1 · 3 citations
Computer Science · Physics and Astronomy · #Parallel Computing and Optimization Techniques #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #quant-ph
paper · pdf · doi:10.1103/physreva.71.052320
published as Phys. Rev. A 71, 052320 (2005) · to appear in PRA 71(5); RevTeX, 12 pages, 12 figures; v2 revision is substantial, with new algorithmic variants, much shorter and clearer text, and revised equation formatting
arxiv created 2005/03/29 · openalex publication_date 2005/05/17 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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\text\ensuremath-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(log\phantom\rule0.2em0exn), 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.