Shor’s algorithm on a nearest-neighbor machine (2007)
by
Samuel A. Kutin
| Venue: | Asian conference on Quantum Information Science |
| Citations: | 5 - 1 self |
BibTeX
@INPROCEEDINGS{Kutin07shor’salgorithm,
author = {Samuel A. Kutin},
title = {Shor’s algorithm on a nearest-neighbor machine},
booktitle = {Asian conference on Quantum Information Science},
year = {2007},
pages = {12--13}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We give a new “nested adds ” circuit for implementing Shor’s algorithm in linear width and quadratic depth on a nearest-neighbor machine. Our circuit combines Draper’s transform adder with approximation ideas of Zalka. The transform adder requires small controlled rotations. We also give another version, with slightly larger depth, using only reversible classical gates. We do not know which version will ultimately be cheaper to implement. 1
Citations
| 179 | Elementary gates for quantum computation - Barenco, Bennett, et al. - 1995 |
| 45 | Fast parallel circuits for the quantum Fourier transform - Cleve, Watrous |
| 27 | Design of an efficient public-key cryptographic library for RISC-based smart cards. PhD thesis, Université Catholique de Louvain, Louvain-la-Neuve - Dhem - 1998 |
| 24 | Fast versions of Shor’s quantum factoring algorithm - Zalka |
| 16 | A new quantum ripple-carry addition circuit. http://arXiv.org/quant-ph/0410184 - Cuccaro, Draper, et al. - 2004 |
| 16 | Implementation of Shor’s Algorithm on a Linear Nearest Neighbour Qubit Array - Fowler, Devitt, et al. - 2004 |
| 14 | 2000), Addition on a quantum computer - Draper |
| 10 | Circuit for Shor’s algorithm using 2n+3 qubits - Beauregard |
| 1 | Shor’s algorithm with fewer (pure) qubits - Zalka - 2006 |
