A linear-size quantum circuit for addition with no ancillary qubits

Y. Takahashi, N. Kunihiro · 2005 · Quantum Information and Computation 5(6):440–448

| 编号 QQFT024 | 主题 量子傅里叶变换 | 链接 doi:10.26421/qic5.6-2 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。 We construct a quantum circuit for addition of two $n$-bit binary numbers that uses no ancillary qubits. The circuit is based on the ripple-carry approach. The depth and size of the circuit are $O(n)$. This is an affirmative answer to the question of Kutin \cite{Kutin} as to whether a linear-depth quantum circuit for addition can be constructed without ancillary qubits using the ripple-carry approach. We also construct quantum circuits for addition modulo $2^n$, subtraction, and comparison that use no ancillary qubits by modifying the circuit for addition.

可确认的信息

标题陈述的两件事是：QFT 加法器，线性规模，且不需要辅助比特。第二点是本站QFT 算术与合成与成本两词条反复引用的地方：它省下的是辅助比特，标题并未主张降低 T 数。

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