A Polylogarithmic-Depth Quantum Multiplier

Fred Sun, Anton Borissov · 2026 · arXiv quant-ph

| 编号 QM016 | 主题 模运算与乘法 | 链接 arXiv:2604.09847 |

摘要

摘要保留原文（英文）

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

We present a quantum algorithm for multiplying two $n$-bit integers with overall circuit depth and $T$-depth both bounded by $O({\log }^{2}n)$, while using $O(n^2)$ gates and ancillary qubits. Our construction generates partial products via indicator-controlled copying and adds them using a binary adder tree, enabling parallel accumulation with logarithmic depth overhead per level. To the best of our knowledge, our design has the lowest $T$-depth among all multiplication algorithms using the Clifford + $T$ model. By optimizing both circuit depth and $T$-depth, our construction advances the practical feasibility of large-scale fault-tolerant quantum algorithms.

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