A Higher Radix Architecture for Quantum Carry-lookahead Adder

Siyi Wang, Anubhab Baksi, Anupam Chattopadhyay · 2023 · arXiv

| 编号 QA016 | 主题 加法与减法 | 链接 arXiv:2304.02921 |

摘要

摘要保留原文（英文）

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

In this paper, we propose an efficient quantum carry-lookahead adder based on the higher radix structure. For the addition of two $n$-bit numbers, our adder uses $O(n)-O(\frac{n}{r})$ qubits and $O(n)+O(\frac{n}{r})$ T gates to get the correct answer in T-depth $O(r)+O(\log \frac{n}{r})$, where $r$ is the radix. Quantum carry-lookahead adder has already attracted some attention because of its low T-depth. Our work further reduces the overall cost by introducing a higher radix layer. By analyzing the performance in T-depth, T-count, and qubit count, it is shown that the proposed adder is superior to existing quantum carry-lookahead adders. Even compared to the Draper out-of-place adder which is very compact and efficient, our adder is still better in terms of T-count.

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