Shor’s algorithm on a nearest-neighbor machine

Samuel A. Kutin · 2006 · arXiv quant-ph

| 编号 QA033 | 主题 加法与减法 | 链接 arXiv:quant-ph/0609001 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

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.

本站词条在引用该文献时，会以 wikilink（sources/QA033）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。