Shor's algorithm on a nearest-neighbor machine

Simple item page
dc.creatorKutin, Samuel A.
dc.date2006-08-31
dc.date.accessioned2026-07-07T07:26:34Z
dc.date.available2026-07-07T07:26:34Z
dc.descriptionWe 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.
dc.description11 pages, 1 color figure
dc.identifierhttps://arxiv.org/abs/quant-ph/0609001
dc.identifierhttp://arxiv.org/abs/quant-ph/0609001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/117122
dc.subjectQuantum Physics
dc.titleShor's algorithm on a nearest-neighbor machine
dc.typetext

Files

Collections

arXiv