A 2D Nearest-Neighbor Quantum Architecture for Factoring [PDF]
Paul Pham, Krysta M. SvoreWe 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.View original: http://arxiv.org/abs/1207.6655
No comments:
Post a Comment