A higher radix architecture for quantum carry-lookahead adder
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. Q...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/173882 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-173882 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1738822024-03-08T15:35:52Z A higher radix architecture for quantum carry-lookahead adder Wang, Siyi Baksi, Anubhab Chattopadhyay, Anupam School of Computer Science and Engineering Computer and Information Science Quantum carry-lookahead adder Higher radix structure 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. Published version 2024-03-05T01:10:30Z 2024-03-05T01:10:30Z 2023 Journal Article Wang, S., Baksi, A. & Chattopadhyay, A. (2023). A higher radix architecture for quantum carry-lookahead adder. Scientific Reports, 13(1), 16338-. https://dx.doi.org/10.1038/s41598-023-41122-4 2045-2322 https://hdl.handle.net/10356/173882 10.1038/s41598-023-41122-4 37770461 2-s2.0-85172825976 1 13 16338 en Scientific Reports © The Author(s) 2023. Open Access. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Computer and Information Science Quantum carry-lookahead adder Higher radix structure |
spellingShingle |
Computer and Information Science Quantum carry-lookahead adder Higher radix structure Wang, Siyi Baksi, Anubhab Chattopadhyay, Anupam A higher radix architecture for quantum carry-lookahead adder |
description |
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. |
author2 |
School of Computer Science and Engineering |
author_facet |
School of Computer Science and Engineering Wang, Siyi Baksi, Anubhab Chattopadhyay, Anupam |
format |
Article |
author |
Wang, Siyi Baksi, Anubhab Chattopadhyay, Anupam |
author_sort |
Wang, Siyi |
title |
A higher radix architecture for quantum carry-lookahead adder |
title_short |
A higher radix architecture for quantum carry-lookahead adder |
title_full |
A higher radix architecture for quantum carry-lookahead adder |
title_fullStr |
A higher radix architecture for quantum carry-lookahead adder |
title_full_unstemmed |
A higher radix architecture for quantum carry-lookahead adder |
title_sort |
higher radix architecture for quantum carry-lookahead adder |
publishDate |
2024 |
url |
https://hdl.handle.net/10356/173882 |
_version_ |
1794549294412333056 |