Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum

A Delay-Efficient Implementation of Quantum Carry Select Adders

Annalisa Massini, Federico Mingardi

Published May 27, 2024• 1 citation
Publisher

Abstract

Quantum addition is a crucial operation for the implementation of quantum algorithms. For this reason, many researchers focused their attention on the design of quantum adders. The two main schemes for adders are the Ripple Carry Adder (RCA), which is considered slow because its execution time depends on the length of the operands, and the Carry Look-ahead Adder, which can reduce the execution time anticipating the computation of the carry, but is more complex and expensive in terms of quantum cost. A good alternative to the slow ripple carry adder and the complex carry-lookahead adder is represented by the Carry Select Adder (CSA), which divides the addition execution into subgroups of qubits and exploits the simplicity of the RCA. In this work, we propose a new quantum version of the CSA, based on an efficient realization of the RCA, chosen among the possible RCAs proposed in the literature. To this end, we show how to design the quantum CSA blocks and how to concatenate them to produce the result. The proposed quantum CSA has been simulated on the DDSIM tool of Munich Quantum Toolkit (MQT) to check its correctness, and the performance has been analyzed using the three conventional parameters for quantum circuits: number of qubits, quantum cost and delay. For each of these parameters, a formula is given as a function of the size of the operand length and the number of blocks in the quantum CSA. The CSA proposed shows a speedup variable from 2.5 to 6 for operands up to 64 qubits and a block size that goes from 2 to n/2.

DOI
10.1109/ipdpsw63119.2024.00181

Related papers

Reversible adder design for ripple carry and carry look ahead (4, 8, 16, 32-bit)

Somani Neelam, Chaudhary Chitrita, S. Ramani Yadav

Reversible logic has represented itself as a prominent technology which plays an important role in Quantum Computing. Theoretically Quantum Computers operates at high speed and consumes less power. Furthermore, Reversible logic can break the conventional speed of power trade-off. To prove this we are implementing Ripple Carry Adder and Carry Look Ahead Adder using reversible logic gates. The paper presents efficient adder circuits using Peres gate, New fault Tolerant gate and Double Feyman gate. The complexity, simulated outputs and the speed parameters for the adder circuit have been indicated using the Quartus II 9.1 edition and Modelsim tool. Moreover, the quantum algorithms can potentially solve NP-complete problems. Furthermore, doing high performance functions beyond the limit of deterministic computer systems is possible by only reversible logic. Quantum operations are unitary in nature which is reversible and hence the arithmetic operations like adders can be implemented using the reversible logic. Likewise, optimized block size, minimum ancillary bits, and one to one mappings of inputs and outputs are obtained in the reversible adder circuit, giving fan out as 1. Hence, the Ripple Carry Adder and Carry look Ahead Adder is providing complexity reduction and high speed, proving to be an efficient and important part in the development of arithmetic blocks of Quantum Computers.

International Conference on Computing, Communication and Automation•Apr 1, 2016•12 citations

Computation Exactness Exploration of Exact Quantum Adders in NISQ

Hyoju Seo, Seokhyeon Lee, Yongtae Kim

With the rise of Noisy Intermediate-Scale Quantum (NISQ) computing, the selection of suitable adders becomes more crucial for optimizing quantum computations. The ripple carry adder (RCA) and carry lookahead adder (CLA) are fundamental quantum adder architectures, yet, their performance under NISQ environments remains to be largely unexplored. In this paper, we extensively compare the RCA and CLA designs through a systematic analysis in NISQ computing. Our results reveal that the proposed quantum RCA has a 29.7% lower error rate than the existing quantum CLA, highlighting the importance of simple exact quantum adder designs tailored for specific noisy quantum hardware constraints. These findings offer the crucial insights for designing efficient quantum algorithms and optimizing quantum circuits for practical NISQ systems.

International SoC Design Conference•Oct 25, 2023•5 citations

Optimization of Ripple Carry Adder using Quantum Computing

N.Parvatham, Rithiga R, Ruzmina M +1 more

This paper presents the design, optimization, and simulation of arithmetic circuits using reversible logic for quantum computing applications. The motivation behind this work is to achieve resource-efficient computation through reduced quantum cost, minimized garbage outputs, and lower ancilla requirements. The methodology involves implementing Half Adders, Full Adders, Multiplexers, and Ripple Carry Adders (RCAs) using Toffoli and Peres gates. The proposed 8-bit RCA achieves a quantum cost of 58 using 24 qubits, 8 garbage outputs, and 6 ancilla inputs—showing a significant improvement over conventional Toffoli-based designs that require higher quantum cost and resources. Simulations were conducted on IBM Qiskit and Google Colab using the Qiskit SDK to validate circuit correctness and scalability. The obtained results demonstrate superior resource efficiency and confirm the feasibility of reversible-logic-based quantum arithmetic as a foundation for scalable quantum arithmetic logic units (ALUs) and processors.

International Conference on Ubiquitous Computing and Intelligent Information Systems (ICUIS)•Nov 26, 2025•0 citations

PARALLELIZATION OF REVERSIBLE RIPPLE-CARRY ADDERS

Michael Kirkedal Thomsen, Holger Bock Axelsen

The design of fast arithmetic logic circuits is an important research topic for reversible and quantum computing. A special challenge in this setting is the computation of standard arithmetical functions without the generation of garbage. Here, we present a novel parallelization scheme wherein m parallel k-bit reversible ripple-carry adders are combined to form a reversible mk-bit ripple-block carry adder with logic depth [Formula: see text] for a minimal logic depth [Formula: see text], thus improving on the mk-bit ripple-carry adder logic depth [Formula: see text]. The underlying mechanisms of the parallelization scheme are formally proven correct. We also show designs for garbage-less reversible comparison circuits. We compare the circuit costs of the resulting ripple-block carry adder with known optimized reversible ripple-carry adders in measures of circuit delay, width, gate, transistor count, and relative power efficiency, and find that the parallelized adder offers significant speedups at realistic word sizes with modest parallelization overhead.

Parallel Processing Letters•Jun 1, 2009•20 citations

Toward Designing High-Speed Cost-Efficient Quantum Reversible Carry Select Adders

Shekoofeh Moghimi, Mohammad Reza Reshadinezhad, Antonio Rubio

Compared to classical computing implementations, reversible arithmetic adders offer a valuable platform for implementing quantum computation models in digital systems and specific applications, such as cryptography and natural language processing. Reversible logic efficiently prevents energy wastage through thermal dissipation. This study presents a comprehensive exploration introducing new carry-select adders (CSLA) based on quantum and reversible logic. Five reversible CSLA designs are proposed and compared, evaluating various criteria, including speed, quantum cost, and area, compared to previously published schemes. These comparative metrics are formulated for arbitrary n-bit size blocks. Each design type is described generically, capable of implementing carry-select adders of any size. As the best outcome, this study proposes an optimized reversible adder circuit that addresses quantum propagation delay, achieving an acceptable trade-off with quantum cost compared to its counterparts. This article reduces calculation delay by 66%, 73%, 82%, and 87% for 16, 32, 64, and 128 bits, respectively, while maintaining a lower quantum cost in all cases.

IEEE Transactions on Emerging Topics in Computing•Nov 20, 2023•12 citations

Quantum Modular Adder over GF(2n − 1) without Saving the Final Carry

Aeyoung Kim, Seong-Min Cho, Chang-Bae Seo +2 more

Addition is the most basic operation of computing based on a bit system. There are various addition algorithms considering multiple number systems and hardware, and studies for a more efficient addition are still ongoing. Quantum computing based on qubits as the information unit asks for the design of a new addition because it is, physically, wholly different from the existing frequency-based computing in which the minimum information unit is a bit. In this paper, we propose an efficient quantum circuit of modular addition, which reduces the number of gates and the depth. The proposed modular addition is for the Galois Field GF(2n−1), which is important as a finite field basis in various domains, such as cryptography. Its design principle was from the ripple carry addition (RCA) algorithm, which is the most widely used in existing computers. However, unlike conventional RCA, the storage of the final carry is not needed due to modifying existing diminished-1 modulo 2n−1 adders. Our proposed adder can produce modulo sum within the range 0,2n−2 by fewer qubits and less depth. For comparison, we analyzed the proposed quantum addition circuit over GF(2n−1) and the previous quantum modular addition circuit for the performance of the number of qubits, the number of gates, and the depth, and simulated it with IBM’s simulator ProjectQ.

Applied Sciences•Mar 25, 2021•8 citations
Quantum addition is a crucial operation for the implementation of quantum algorithms. For this reason, many researchers focused their attention on the design of quantum adders. The two main schemes for adders are the Ripple Carry Adder (RCA), which is considered slow because its execution time depends on the length of the operands, and the Carry Look-ahead Adder, which can reduce the execution time anticipating the computation of the carry, but is more complex and expensive in terms of quantum cost. A good alternative to the slow ripple carry adder and the complex carry-lookahead adder is represented by the Carry Select Adder (CSA), which divides the addition execution into subgroups of qubits and exploits the simplicity of the RCA. In this work, we propose a new quantum version of the CSA, based on an efficient realization of the RCA, chosen among the possible RCAs proposed in the literature. To this end, we show how to design the quantum CSA blocks and how to concatenate them to produce the result. The proposed quantum CSA has been simulated on the DDSIM tool of Munich Quantum Toolkit (MQT) to check its correctness, and the performance has been analyzed using the three conventional parameters for quantum circuits: number of qubits, quantum cost and delay. For each of these parameters, a formula is given as a function of the size of the operand length and the number of blocks in the quantum CSA. The CSA proposed shows a speedup variable from 2.5 to 6 for operands up to 64 qubits and a block size that goes from 2 to n/2.
Reversible logic has represented itself as a prominent technology which plays an important role in Quantum Computing. Theoretically Quantum Computers operates at high speed and consumes less power. Furthermore, Reversible logic can break the conventional speed of power trade-off. To prove this we are implementing Ripple Carry Adder and Carry Look Ahead Adder using reversible logic gates. The paper presents efficient adder circuits using Peres gate, New fault Tolerant gate and Double Feyman gate. The complexity, simulated outputs and the speed parameters for the adder circuit have been indicated using the Quartus II 9.1 edition and Modelsim tool. Moreover, the quantum algorithms can potentially solve NP-complete problems. Furthermore, doing high performance functions beyond the limit of deterministic computer systems is possible by only reversible logic. Quantum operations are unitary in nature which is reversible and hence the arithmetic operations like adders can be implemented using the reversible logic. Likewise, optimized block size, minimum ancillary bits, and one to one mappings of inputs and outputs are obtained in the reversible adder circuit, giving fan out as 1. Hence, the Ripple Carry Adder and Carry look Ahead Adder is providing complexity reduction and high speed, proving to be an efficient and important part in the development of arithmetic blocks of Quantum Computers.
With the rise of Noisy Intermediate-Scale Quantum (NISQ) computing, the selection of suitable adders becomes more crucial for optimizing quantum computations. The ripple carry adder (RCA) and carry lookahead adder (CLA) are fundamental quantum adder architectures, yet, their performance under NISQ environments remains to be largely unexplored. In this paper, we extensively compare the RCA and CLA designs through a systematic analysis in NISQ computing. Our results reveal that the proposed quantum RCA has a 29.7% lower error rate than the existing quantum CLA, highlighting the importance of simple exact quantum adder designs tailored for specific noisy quantum hardware constraints. These findings offer the crucial insights for designing efficient quantum algorithms and optimizing quantum circuits for practical NISQ systems.
This paper presents the design, optimization, and simulation of arithmetic circuits using reversible logic for quantum computing applications. The motivation behind this work is to achieve resource-efficient computation through reduced quantum cost, minimized garbage outputs, and lower ancilla requirements. The methodology involves implementing Half Adders, Full Adders, Multiplexers, and Ripple Carry Adders (RCAs) using Toffoli and Peres gates. The proposed 8-bit RCA achieves a quantum cost of 58 using 24 qubits, 8 garbage outputs, and 6 ancilla inputs—showing a significant improvement over conventional Toffoli-based designs that require higher quantum cost and resources. Simulations were conducted on IBM Qiskit and Google Colab using the Qiskit SDK to validate circuit correctness and scalability. The obtained results demonstrate superior resource efficiency and confirm the feasibility of reversible-logic-based quantum arithmetic as a foundation for scalable quantum arithmetic logic units (ALUs) and processors.
The design of fast arithmetic logic circuits is an important research topic for reversible and quantum computing. A special challenge in this setting is the computation of standard arithmetical functions without the generation of garbage. Here, we present a novel parallelization scheme wherein m parallel k-bit reversible ripple-carry adders are combined to form a reversible mk-bit ripple-block carry adder with logic depth [Formula: see text] for a minimal logic depth [Formula: see text], thus improving on the mk-bit ripple-carry adder logic depth [Formula: see text]. The underlying mechanisms of the parallelization scheme are formally proven correct. We also show designs for garbage-less reversible comparison circuits. We compare the circuit costs of the resulting ripple-block carry adder with known optimized reversible ripple-carry adders in measures of circuit delay, width, gate, transistor count, and relative power efficiency, and find that the parallelized adder offers significant speedups at realistic word sizes with modest parallelization overhead.
Compared to classical computing implementations, reversible arithmetic adders offer a valuable platform for implementing quantum computation models in digital systems and specific applications, such as cryptography and natural language processing. Reversible logic efficiently prevents energy wastage through thermal dissipation. This study presents a comprehensive exploration introducing new carry-select adders (CSLA) based on quantum and reversible logic. Five reversible CSLA designs are proposed and compared, evaluating various criteria, including speed, quantum cost, and area, compared to previously published schemes. These comparative metrics are formulated for arbitrary n-bit size blocks. Each design type is described generically, capable of implementing carry-select adders of any size. As the best outcome, this study proposes an optimized reversible adder circuit that addresses quantum propagation delay, achieving an acceptable trade-off with quantum cost compared to its counterparts. This article reduces calculation delay by 66%, 73%, 82%, and 87% for 16, 32, 64, and 128 bits, respectively, while maintaining a lower quantum cost in all cases.
Addition is the most basic operation of computing based on a bit system. There are various addition algorithms considering multiple number systems and hardware, and studies for a more efficient addition are still ongoing. Quantum computing based on qubits as the information unit asks for the design of a new addition because it is, physically, wholly different from the existing frequency-based computing in which the minimum information unit is a bit. In this paper, we propose an efficient quantum circuit of modular addition, which reduces the number of gates and the depth. The proposed modular addition is for the Galois Field GF(2n−1), which is important as a finite field basis in various domains, such as cryptography. Its design principle was from the ripple carry addition (RCA) algorithm, which is the most widely used in existing computers. However, unlike conventional RCA, the storage of the final carry is not needed due to modifying existing diminished-1 modulo 2n−1 adders. Our proposed adder can produce modulo sum within the range 0,2n−2 by fewer qubits and less depth. For comparison, we analyzed the proposed quantum addition circuit over GF(2n−1) and the previous quantum modular addition circuit for the performance of the number of qubits, the number of gates, and the depth, and simulated it with IBM’s simulator ProjectQ.