Wang Siyi, Baksi Anubhab, Chattopadhyay Anupam
School of Computer Science and Engineering, Nanyang Technological University, Singapore, 639798, Singapore.
Sci Rep. 2023 Sep 28;13(1):16338. doi: 10.1038/s41598-023-41122-4.
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 [Formula: see text] qubits and [Formula: see text] T gates to get the correct answer in T-depth [Formula: see text], 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.
在本文中，我们提出了一种基于更高基数结构的高效量子超前进位加法器。对于两个n位数字的加法，我们的加法器使用[公式：见正文]个量子比特和[公式：见正文]个T门，在T深度为[公式：见正文]的情况下得到正确答案，其中r是基数。量子超前进位加法器因其低T深度已经引起了一些关注。我们的工作通过引入更高基数层进一步降低了总成本。通过分析T深度、T计数和量子比特计数方面的性能，结果表明所提出的加法器优于现有的量子超前进位加法器。即使与非常紧凑高效的德雷珀异位加法器相比，我们的加法器在T计数方面仍然更优。
