Fast quantum modular exponentiation
- 17 May 2005
- journal article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 71 (5)
- https://doi.org/10.1103/physreva.71.052320
Abstract
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 number, for storage space (20 times the minimum ), we can execute modular exponentiation 200–700 times faster than optimized versions of the basic algorithms, depending on architecture, for . Addition on a neighbor-only architecture is limited to time, whereas non-neighbor architectures can reach , 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.
Keywords
Other Versions
This publication has 16 references indexed in Scilit:
- Quantum oscillations in two coupled charge qubitsNature, 2003
- Scalable Quantum Computing with Josephson Charge QubitsPhysical Review Letters, 2002
- All-Silicon Quantum ComputerPhysical Review Letters, 2002
- Architecture for a large-scale ion-trap quantum computerNature, 2002
- Quantum Logic Gates in Optical LatticesPhysical Review Letters, 1999
- Quantum computation with quantum dotsPhysical Review A, 1998
- Efficient networks for quantum factoringPhysical Review A, 1996
- Quantum networks for elementary arithmetic operationsPhysical Review A, 1996
- Elementary gates for quantum computationPhysical Review A, 1995
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992