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

International Conference on Circuits, Power and Intelligent Systems (CCPIS)

Design and Analysis of Quantum Binary Adder-Subtractor Using IBM Qiskit

Rajan Singh, S V S Prasad, Kiran Dasari, Pulkit Singh, Mahesh Bora, Peddinti Hinduja

Published Sep 1, 2023• 3 citations
Publisher

Abstract

In this paper, an n-bit Quantum Binary Adder-Subtractor (QBAS) is designed using quantum logic gates using IBM Qiskit. A comprehensive understanding of the principles of quantum computing and quantum logic gates is also provided. As the fundamental module of a binary adder-subtractor circuit is a full adder, various designs of quantum full adders (QFAs) from the literature are investigated on various aspects to deliberately choose the best quantum full adder suitable for QBAS application. A QBAS circuit is thus designed using the selected QFA, analyzed and tested for its ability to replicate the output of its classical counterpart. The results obtained here will aid researchers in the design of Quantum Arithmetic Logic Units (QALUs), Quantum multipliers, dividers, and other scalable adder circuits. The proposed circuits and its results shown here expected to pave the way for design of compact and state of the art quantum adders with reduced number of qubits, quantum cost.

DOI
10.1109/ccpis59145.2023.10292104

Related papers

A Novel Design of Reversible Adder - Subtractor Circuit Using IBM Qiskit

Anupam Patra, Agniswar Banerjee, Debmalya Dash +2 more

Quantum processors are a central element of a quantum computer. Processors are responsible for performing the fundamental operations like addition, subtraction, etc. of any computer. This also involves the arithmetic unit and has a different configuration for the quantum computer than for a classical computer. Multiplication is essentially repeated addition and division is repeated subtraction. But for quantum computer other methodologies have to be used for arithmetic. In this paper a Quantum Full Adder/Subtractor Circuit, using the reversible Peres Gate, R3Gate and a NOT Gate, is proposed. So, the proposed design can be used for both modes, adder and subtractor on quantum operation. The authors have also compared proposed design with other designs reported, in terms of Gate count, Garbage bits, Quantum cost and Delay. The authors have achieved a 62.5% increment in delay and a low power computing reversible logic in which the computation is faster and energy efficient. Using IBM Qiskit, the authors have created and tested the circuit.

International Conference on Control, Computing, Communication and Materials (ICCCCM)•Aug 10, 2024•0 citations

Design of Reversible Binary Half and Full Adder/Subtractor Using Reversible Gates

Arwa S. Bazmalah, Noorfazila Kamal

The power consumption in classical computers has grown to be a critical issue. Thus, quantum computers have become a promising alternative to classical computers for more processing power and lower energy consumption. Reversible gates are important for building the quantum computers. Reversible circuits have various applications, such as digital signal processing, optical computing, quantum computing, etc. The design and synthesis of reversible gates and circuits have grown in popularity and attracted the attention of many researchers. The adder and subtractor are important computation blocks for the structure of the Arithmetic Logic Unit (ALU). In this paper, a design of reversible binary half and full adders and subtractors using reversible logic gates is proposed. The TR (Thapliyal Ranganathan) and Peres gates are used to construct the reversible half adder and subtractor circuit. Meanwhile, the Double Peres Gate (DPG), Fredkin, and NOT gates are used to build the reversible 1-bit full adder and subtractor circuit. The designs are optimized in terms of number of gates, constant inputs, garbage outputs, and quantum cost. The truth table representation and the Binary Decision Diagram (BDD) synthesis method are used to represent and synthesize the circuits, respectively. The circuits are synthesized and simulated using the Verilog Hardware Description Language code and Xilinx ISE 14.7. The results show that the proposed designs achieve the lowest quantum cost in both half adder/subtractor and full adder/subtractor. As the half adder/subtractor has six quantum cost and the full adder/subtractor has nine quantum cost.

Progress in Engineering Application and Technology•Dec 19, 2022•0 citations

Design and Implementation of a Quantum Reversible Full Adder-Subtractor

Indra J, Siva Prasanna E, Sushma V.R

Arithmetic units are the computational cores of any processor, and among them, the full adder-subtractor circuit can be regarded as the most fundamental, as it can support the entire spectrum of computation, ranging from integer arithmetic to filtering and cryptographic functions. In the context of quantum computing, these units must be implemented using reversible logic gates that preserve the information processed, as any loss of information violates the principles of the unitary dynamics of quantum mechanics and the thermodynamic principle of bit erasure. In the context of the full adder-subtractor circuit, the previous implementations had three main drawbacks, namely, the use of multiple ancilla input qubits, the generation of garbage qubits, and the use of non-native gates. In this paper, a novel implementation of the reversible full adder-subtractor circuit using the IBM Quantum Composer tool, with the support of only the native gates of the IBM Quantum device, namely, the Hadamard, the Controlled-NOT, and the Toffoli gates, is proposed. The proposed circuit works with six qubits and thirteen gates, with a quantum cost of 13, zero ancilla inputs, and zero garbage outputs simultaneously. The circuit uses only one mode select qubit (M) for operation. When M is 0, the circuit works for full addition with Sum and Carry-out. When M is 1, the circuit works for full subtraction with Difference and Borrow-out through a two's complement B-inversion method. The circuit is simulated using the IBM Quantum composer Simulator with 1024 shots. The Hadamard-based superposition method is used to test all eight input combinations simultaneously in a single run.

International Conference Inventive Material Science Applications•May 1, 2026•0 citations

A High-Speed Quantum Reversible Controlled Adder/Subtractor Circuit

Negin Mashayekhi, Mohammad Reza Reshadinezhad, Shekoofeh Moghimi

Reversible logic is becoming increasingly important with the rise of technologies like quantum computing, as it retains information during computation and maintains a direct match between each input and its corresponding output. Quantum circuits are inherently reversible and the best computational model in quantum computing systems. Quantum computers require quantum processors. A critical component of any computer's processor is the arithmetic component, that handles binary operations like addition, subtraction, multiplication, and division. Notably, multiplication can be accomplished by repeatedly adding, while division can be carried out by repeatedly subtracting. This paper proposes a new design of quantum-controlled adder/subtractor (QCAS) with efficient quantum criteria like delay, quantum cost, number of ancilla and of garbage outputs. We propose a quantum reversible controlled full adder/subtractor block which is applied to construct an n-bit quantum adder/subtractor circuit. The proposed circuit is simulated using the Quirk online tool and the result confirms the accuracy of the design. This design achieves 28.5% and 61.3% improvement in delay and garbage outputs, and 14% and 41.2% increase in quantum cost and constant input, compared to its counterpart, respectively.

International Conference on Information and Knowledge Technology (IKT)•Dec 24, 2024•1 citation

Quantum full adder and subtractor

Kai-Wen Cheng, Chien‐Cheng Tseng

The designs of quantum full adder (QFA) and quantum full subtractor (QFS) are investigated. First, the 1-bit QFA and 1-bit QFS are designed according to the classical truth tables. The adder and subtractor for two n-bits numbers are then separately constructed from n 1-bit QFAs and QFSs. The number of elementary quantum gates to accomplish the design of n-bits adder and subtractor are 4n and 8n, respectively.

Electronics Letters•Oct 24, 2002•47 citations

A Feasible Design of Elementary Quantum Arithmetic Logic Units for Near-Term Quantum Computers

Junxu Li

Quantum arithmetic logic units (QALUs) constitute a fundamental component of quantum computing. However, the implementation of QALUs on near-term quantum computers remains a substantial challenge, largely due to the limited connectivity of qubits. In this paper, we propose feasible QALUs, including quantum binary adders, subtractors, multipliers, and dividers, which are designed for near-term quantum computers with qubits arranged in two-dimensional arrays. Additionally, we introduce a feasible quantum arithmetic operation to compute the two's complement representation of signed integers. The proposed QALUs utilize only Pauli-X gates, CNOT gates, and $C\sqrt{X}$ (CSX) gates, and all two-qubit gates are operated between nearest neighbor qubits. Our work demonstrates a viable implementation of QALUs on near-term quantum computers, advancing towards scalable and resource-efficient quantum arithmetic operations.

arXiv:2408.06561•Aug 13, 2024•2 citations
In this paper, an n-bit Quantum Binary Adder-Subtractor (QBAS) is designed using quantum logic gates using IBM Qiskit. A comprehensive understanding of the principles of quantum computing and quantum logic gates is also provided. As the fundamental module of a binary adder-subtractor circuit is a full adder, various designs of quantum full adders (QFAs) from the literature are investigated on various aspects to deliberately choose the best quantum full adder suitable for QBAS application. A QBAS circuit is thus designed using the selected QFA, analyzed and tested for its ability to replicate the output of its classical counterpart. The results obtained here will aid researchers in the design of Quantum Arithmetic Logic Units (QALUs), Quantum multipliers, dividers, and other scalable adder circuits. The proposed circuits and its results shown here expected to pave the way for design of compact and state of the art quantum adders with reduced number of qubits, quantum cost.
Quantum processors are a central element of a quantum computer. Processors are responsible for performing the fundamental operations like addition, subtraction, etc. of any computer. This also involves the arithmetic unit and has a different configuration for the quantum computer than for a classical computer. Multiplication is essentially repeated addition and division is repeated subtraction. But for quantum computer other methodologies have to be used for arithmetic. In this paper a Quantum Full Adder/Subtractor Circuit, using the reversible Peres Gate, R3Gate and a NOT Gate, is proposed. So, the proposed design can be used for both modes, adder and subtractor on quantum operation. The authors have also compared proposed design with other designs reported, in terms of Gate count, Garbage bits, Quantum cost and Delay. The authors have achieved a 62.5% increment in delay and a low power computing reversible logic in which the computation is faster and energy efficient. Using IBM Qiskit, the authors have created and tested the circuit.
The power consumption in classical computers has grown to be a critical issue. Thus, quantum computers have become a promising alternative to classical computers for more processing power and lower energy consumption. Reversible gates are important for building the quantum computers. Reversible circuits have various applications, such as digital signal processing, optical computing, quantum computing, etc. The design and synthesis of reversible gates and circuits have grown in popularity and attracted the attention of many researchers. The adder and subtractor are important computation blocks for the structure of the Arithmetic Logic Unit (ALU). In this paper, a design of reversible binary half and full adders and subtractors using reversible logic gates is proposed. The TR (Thapliyal Ranganathan) and Peres gates are used to construct the reversible half adder and subtractor circuit. Meanwhile, the Double Peres Gate (DPG), Fredkin, and NOT gates are used to build the reversible 1-bit full adder and subtractor circuit. The designs are optimized in terms of number of gates, constant inputs, garbage outputs, and quantum cost. The truth table representation and the Binary Decision Diagram (BDD) synthesis method are used to represent and synthesize the circuits, respectively. The circuits are synthesized and simulated using the Verilog Hardware Description Language code and Xilinx ISE 14.7. The results show that the proposed designs achieve the lowest quantum cost in both half adder/subtractor and full adder/subtractor. As the half adder/subtractor has six quantum cost and the full adder/subtractor has nine quantum cost.
Arithmetic units are the computational cores of any processor, and among them, the full adder-subtractor circuit can be regarded as the most fundamental, as it can support the entire spectrum of computation, ranging from integer arithmetic to filtering and cryptographic functions. In the context of quantum computing, these units must be implemented using reversible logic gates that preserve the information processed, as any loss of information violates the principles of the unitary dynamics of quantum mechanics and the thermodynamic principle of bit erasure. In the context of the full adder-subtractor circuit, the previous implementations had three main drawbacks, namely, the use of multiple ancilla input qubits, the generation of garbage qubits, and the use of non-native gates. In this paper, a novel implementation of the reversible full adder-subtractor circuit using the IBM Quantum Composer tool, with the support of only the native gates of the IBM Quantum device, namely, the Hadamard, the Controlled-NOT, and the Toffoli gates, is proposed. The proposed circuit works with six qubits and thirteen gates, with a quantum cost of 13, zero ancilla inputs, and zero garbage outputs simultaneously. The circuit uses only one mode select qubit (M) for operation. When M is 0, the circuit works for full addition with Sum and Carry-out. When M is 1, the circuit works for full subtraction with Difference and Borrow-out through a two's complement B-inversion method. The circuit is simulated using the IBM Quantum composer Simulator with 1024 shots. The Hadamard-based superposition method is used to test all eight input combinations simultaneously in a single run.
Reversible logic is becoming increasingly important with the rise of technologies like quantum computing, as it retains information during computation and maintains a direct match between each input and its corresponding output. Quantum circuits are inherently reversible and the best computational model in quantum computing systems. Quantum computers require quantum processors. A critical component of any computer's processor is the arithmetic component, that handles binary operations like addition, subtraction, multiplication, and division. Notably, multiplication can be accomplished by repeatedly adding, while division can be carried out by repeatedly subtracting. This paper proposes a new design of quantum-controlled adder/subtractor (QCAS) with efficient quantum criteria like delay, quantum cost, number of ancilla and of garbage outputs. We propose a quantum reversible controlled full adder/subtractor block which is applied to construct an n-bit quantum adder/subtractor circuit. The proposed circuit is simulated using the Quirk online tool and the result confirms the accuracy of the design. This design achieves 28.5% and 61.3% improvement in delay and garbage outputs, and 14% and 41.2% increase in quantum cost and constant input, compared to its counterpart, respectively.
Quantum arithmetic logic units (QALUs) constitute a fundamental component of quantum computing. However, the implementation of QALUs on near-term quantum computers remains a substantial challenge, largely due to the limited connectivity of qubits. In this paper, we propose feasible QALUs, including quantum binary adders, subtractors, multipliers, and dividers, which are designed for near-term quantum computers with qubits arranged in two-dimensional arrays. Additionally, we introduce a feasible quantum arithmetic operation to compute the two's complement representation of signed integers. The proposed QALUs utilize only Pauli-X gates, CNOT gates, and CXC\sqrt{X}CX​ (CSX) gates, and all two-qubit gates are operated between nearest neighbor qubits. Our work demonstrates a viable implementation of QALUs on near-term quantum computers, advancing towards scalable and resource-efficient quantum arithmetic operations.