Robustness of Shor's algorithm with finite rotation control
Austin G. Fowler, Lloyd C. L. Hollenberg · arXiv (Cornell University) · 2003
Shor's factorization algorithm is arguably the driving force behind much experimental quantum computer research. It is therefore crucial to investigate whether realistic quantum computers can successfully run Shor's algorithm on integers of commercially interesting length. In this paper we investigate in detail the effect of imposing a rotation control limit of 2Pi/2^d_max. It is found that integers thousands of bits long can be factorized provided rotation gates of magnitude Pi/64 can be implemented.