Performance scaling of Shor's algorithm with a banded quantum Fourier transform

Y. S. Nam, R. Blümel
2012 Physical Review A. Atomic, Molecular, and Optical Physics  
In excellent agreement with our numerical simulations of Shor's algorithm, equipped with a truncated quantum Fourier transform of bandwidth b, we find that its performance scales ∼2 −ξ b n , where n is the number of qubits, ξ b = 1.1 × 2 −2b , and the bandwidth b is the number of quantum states coupled by the quantum Fourier transform. Nonexponential behavior is observed for small n and explained analytically. The large-n exponential scaling implies that b = 7 is sufficient to operate a
more » ... o operate a 1000-qubit quantum computer running Shor's algorithm on the 95% performance level and implies hardware savings of the order of half a million rotation gates.
doi:10.1103/physreva.86.044303 fatcat:4j3pmd5bunhxtf5out24miquyy