Faster Quantum Number Factoring via Circuit Synthesis
Quantum Physics
2013-01-16 v1 Data Structures and Algorithms
Emerging Technologies
Abstract
A major obstacle to implementing Shor's quantum number-factoring algorithm is the large size of modular-exponentiation circuits. We reduce this bottleneck by customizing reversible circuits for modular multiplication to individual runs of Shor's algorithm. Our circuit-synthesis procedure exploits spectral properties of multiplication operators and constructs optimized circuits from the traces of the execution of an appropriate GCD algorithm. Empirically, gate counts are reduced by 4-5 times, and circuit latency is reduced by larger factors.
Cite
@article{arxiv.1301.3210,
title = {Faster Quantum Number Factoring via Circuit Synthesis},
author = {Igor L. Markov and Mehdi Saeedi},
journal= {arXiv preprint arXiv:1301.3210},
year = {2013}
}
Comments
4 pages, 2 figures, 1 table