We present a 2D nearest-neighbor quantum architecture for Shor's factoring algorithm in polylogarithmic depth. Our implementation uses parallel phase estimation, constant-depth fanout and teleportation, and constant-depth carry-save modular addition. We derive asymptotic bounds on the circuit depth and width of our architecture and provide a comparison to all previous nearest-neighbor factoring implementations.

PDF file

In  Reversible Computing 2012

Publisher  

Details