Quantum Circuits for Toom-Cook Multiplication

Srijit Dutta, Debjyoti Bhattacharjee, Anupam Chattopadhyay · 2018 · Phys. Rev. A 98, 012311

| 编号 QM003 | 主题 模运算与乘法 | 链接 arXiv:1805.02342 |

摘要

摘要保留原文（英文）

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

In this paper, we report efficient quantum circuits for integer multiplication using Toom-Cook algorithm. By analysing the recursive tree structure of the algorithm, we obtained a bound on the count of Toffoli gates and qubits. These bounds are further improved by employing reversible pebble games through uncomputing the intermediate results. The asymptotic bounds for different performance metrics of the proposed quantum circuit are superior to the prior implementations of multiplier circuits using schoolbook and Karatsuba algorithms.

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