A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depth
Quantum Information and Computation · 2013-11 · 13 (11&12) · 937-962
DOI: 10.26421/qic13.11-12-3 ↗Kurz gefasst
Fachartikel in der Zeitschrift Quantum Information and Computation, 2013-11. Verfasst von Paul Pham und 1 weiteren Autor:innen. Die Arbeit wurde bisher 30-mal zitiert (Crossref).
Abstract (Originalsprache)
We present a 2D nearest-neighbor quantum architecture for Shor's algorithm to factor an $n$-bit number in $O(\log^3n)$ depth. Our implementation uses parallel phase estimation, constant-depth fanout and teleportation, and constant-depth carry-save modular addition. We derive upper bounds on the circuit resources of our architecture under a new 2D model which allows a classical controller and parallel, communicating modules. We provide a comparison to all previous nearest-neighbor factoring implementations. Our circuit results in an exponential improvement in nearest-neighbor circuit depth at the cost of a polynomial increase in circuit size and width.
Zitieren
APA
Pham, P., & Svore, K. M. (2013). A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depth. Quantum Information and Computation, 13(11&12), 937-962. https://doi.org/10.26421/qic13.11-12-3
Vancouver
Pham P, Svore KM. A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depth. Quantum Information and Computation. 2013;13(11&12):937-962. doi:10.26421/qic13.11-12-3
BibTeX
@article{Pham2013,
author = {Pham, Paul and Svore, Krysta M.},
title = {A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depth},
journal = {Quantum Information and Computation},
year = {2013},
volume = {13},
number = {11&12},
pages = {937--962},
doi = {10.26421/qic13.11-12-3}
}
EUVIMED