Approximate encoded permutations and piecewise quantum adders

Craig Gidney · 2019 · arXiv

| 编号 QA026 | 主题 加法与减法 | 链接 arXiv:1905.08488 |

摘要

摘要保留原文（英文）

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

We present a paradigm for constructing approximate quantum circuits from reversible classical circuits that operate on many possible encodings of an input and send almost all encodings of that input to an encoding of the correct output. We introduce oblivious carry runways, which use piecewise addition circuits to perform approximate encoded additions and reduce the asymptotic depth of addition to $O(\lg \lg n)$. We show that the coset representation of modular integers (Zalka 2006) is an approximate encoded modular addition, and that it can be used in combination with oblivious carry runways. We prove error bounds on these approximate representations, and use them to construct 2s-complement adders and modular adders with lower costs than in previous work at register sizes relevant in practice.

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