Robustness of Shor's algorithm
Simon J. Devitt, Austin G. Fowler, Lloyd C. L. Hollenberg · 2006
Shor’s factorisation algorithm is a combination of classical pre- and post-processing and a quantum period finding (QPF) subroutine which allows an exponential speed up over classical factoring algorithms. We consider the stability of this subroutine when exposed to a discrete error model that acts to perturb the computational trajectory of a quantum computer. Through detailed state vector simulations