A 2D Nearest-Neighbor Quantum Architecture for Factoring

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.

1207.6655.pdf
PDF file
0937-0962-print.pdf
PDF file

In  Quantum Information and Computation

Publisher  Rinton Press

Details

TypeArticle
URLhttp://arxiv.org/abs/1207.6655
Pages0937-0962
Volume13
Number11&12
> Publications > A 2D Nearest-Neighbor Quantum Architecture for Factoring