| Autor: |
Siyi Wang, Anubhab Baksi, Anupam Chattopadhyay |
| Jazyk: |
angličtina |
| Rok vydání: |
2023 |
| Předmět: |
|
| Zdroj: |
Scientific Reports, Vol 13, Iss 1, Pp 1-15 (2023) |
| Druh dokumentu: |
article |
| ISSN: |
2045-2322 |
| DOI: |
10.1038/s41598-023-41122-4 |
| Popis: |
Abstract 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})$$ O ( n ) - O ( n r ) qubits and $$O(n)+O(\frac{n}{r})$$ O ( n ) + O ( n r ) T gates to get the correct answer in T-depth $$O(r)+O(\log {\frac{n}{r}})$$ O ( r ) + O ( log 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. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
|
Nepřihlášeným uživatelům se plný text nezobrazuje |
K zobrazení výsledku je třeba se přihlásit.
|
