Faster quantum number factoring via circuit synthesis
Abstract
A major obstacle to implementing Shor's quantum numberfactoring algorithm is the large size of modularexponentiation circuits. We reduce this bottleneck by customizing reversible circuits for modular multiplication to individual runs of Shor's algorithm. Our circuitsynthesis procedure exploits spectral properties of multiplication operators and constructs optimized circuits from the traces of the execution of an appropriate greatestcommondivisor algorithm. Empirically, gate counts are reduced by four to five times, and circuit latency is reduced by larger factors.
 Publication:

Physical Review A
 Pub Date:
 January 2013
 DOI:
 10.1103/PhysRevA.87.012310
 arXiv:
 arXiv:1301.3210
 Bibcode:
 2013PhRvA..87a2310M
 Keywords:

 03.67.Ac;
 03.67.Lx;
 89.70.Eg;
 Quantum algorithms protocols and simulations;
 Quantum computation;
 Computational complexity;
 Quantum Physics;
 Computer Science  Data Structures and Algorithms;
 Computer Science  Emerging Technologies
 EPrint:
 4 pages, 2 figures, 1 table