Fast quantum modular exponentiation
Fast quantum modular exponentiation
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{-}}\text{bit}$ number, for storage space $100n$ (20 times the minimum $5n$), …