Integer Arithmetic With Hybrid Quantum-Classical Circuits

Christopher M. Maynard, Einar Pius · 2013 · arXiv quant-ph

| 编号 QM018 | 主题 模运算与乘法 | 链接 arXiv:1304.4069 |

摘要

摘要保留原文（英文）

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

Quantum circuits which perform integer arithmetic could potentially outperform their classical counterparts. In this paper, a quantum circuit is considered which performs a specific computational pattern on classically represented integers to accelerate the computation. Such a hybrid circuit could be embedded in a conventional computer architecture as a quantum device or accelerator. In particular, a quantum multiply-add circuit (QMAC) using a Quantum Fourier Transform (QFT) is proposed which can perform the calculation on conventional integers faster than its conventional counterpart. Whereas classically applying a multiply-adder (MAC) $n$ times to $k$ bit integers would require $O(n\log k)$ parallel steps, the hybrid QMAC needs only $O(n+k)$ steps for the exact result and $O(n+\log k)$ steps for an approximate result.

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