Fast Quantum Modular Exponentiation

Simple item page
dc.creatorVan Meter, R.
dc.creatorItoh, K. M.
dc.date2004-08-01
dc.date2005-03-29
dc.date.accessioned2026-07-07T06:10:31Z
dc.date.available2026-07-07T06:10:31Z
dc.descriptionWe 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.
dc.descriptionto 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
dc.identifierhttps://arxiv.org/abs/quant-ph/0408006
dc.identifierhttp://arxiv.org/abs/quant-ph/0408006
dc.identifierPhys. Rev. A 71, 052320 (2005)
dc.identifierdoi:10.1103/PhysRevA.71.052320
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/92276
dc.subjectQuantum Physics
dc.titleFast Quantum Modular Exponentiation
dc.typetext

Files

Collections

arXiv