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 Journal of Novel Research and Development

IMPLEMENTATION AND SIMULATION OF A QUANTUM HALF ADDER USING IBM QISKIT

Krishnaveni Guduru, Devi Prasanna Vempa, Manideepa Mekala, Anusha Pondugula

Published Sep 1, 2026• 0 citations
Publisher

Abstract

Quantum computing is an emerging computational paradigm that represents and processes information using quantum states. This paper presents the implementation and simulation of a Quantum Half Adder using the IBM Qiskit framework. The proposed circuit performs one-bit binary addition and produces two outputs, SUM and CARRY, through reversible quantum operations. Classical input values are encoded into quantum states using Pauli-X gates. Controlled-NOT (CNOT) gates are used to realize the XOR relationship required for SUM generation, while a Toffoli (CCNOT) gate realizes the AND relationship required for CARRY generation. The complete design is implemented in Python and executed using the Qiskit Aer Simulator. Four possible input combinations are evaluated and the measured outputs are compared with the expected Half Adder truth table. Circuit visualization, terminal output, and measurement histograms are used to verify the operation. The results show that the simulated circuit produces the expected SUM and CARRY values for all input combinations. The work provides a simple practical model for understanding reversible quantum computation, quantum gates, and Qiskit-based quantum circuit simulation.

DOI
10.56975/ijnrd.v11i9.328213

Related papers

STUDY AND REALIZATION OF SIMPLE QUANTUM GATES

Lavanya Ravala, S. Vishnu Priya, G .V. Sujitha +2 more

Quantum computing represents a paradigm shift in computation by leveraging the principles of quantum mechanics such as superposition, entanglement, and interference to perform operations beyond classical limitations. Unlike classical computing systems that rely on irreversible logic operations and suffer from energy dissipation due to information loss, quantum systems utilize reversible unitary transformations that preserve information and improve computational efficiency. This paper presents a comprehensive framework for the design, simulation, and validation of quantum gates and reversible arithmetic circuits, including half adders and half subtractors. The proposed approach systematically maps classical arithmetic logic into quantum circuits using fundamental quantum gates such as Pauli-X, Hadamard, Controlled-NOT (CNOT), and Toffoli gates. The circuits are implemented and simulated using the Qiskit Aer framework, enabling detailed analysis of quantum state evolution and measurement outputs. The results obtained from simulation include program-level outputs, state vector representations, measurement counts, and probability distributions, all of which demonstrate strong agreement with classical truth tables. The analysis confirms the correctness, reversibility, and scalability of the proposed designs. Furthermore, a comparative performance evaluation highlights the advantages of quantum computing over classical approaches in terms of parallelism and energy efficiency. The proposed framework establishes a robust foundation for future implementation of complex Boolean logic and arithmetic operations in quantum systems.

International Journal of Novel Research and Development•Apr 1, 2026•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

Quantum Arithmetic Circuits Simulation using IBM – Quantum Experience

Dr.T.Godhavari U.Jayalatsumi

The futuristic computing systems with low power dissipation are of interest among Researchers. Reversible logic provides less power dissipation as well as individual output assignment for each individual input. Hence designing reversible circuits are of great importance which finds significant application in Quantum Computing. It is a kind of computing that performs operations on data using quantum mechanical properties, such as superposition and entanglement. Unlike classical computing, quantum computing works on quantum bits. Qubits are processed by Quantum circuits, the basic building blocks of Quantum Computers. In this paper reversible Quantum arithmetic circuit like half adder, full adder, half subtractor and full subtractor are simulated using IBM Q simulator and the corresponding truth tables are verified.

Solid State Technology•Dec 4, 2020•0 citations

Experimental Realisation of Reversible Quantum Half Adder and Half-Subtractor on IBM Quantum Device with Coherence–Decoherence Noise Analysis

Atanu Kumar Das, Chiradeep Mukherjee, Subhradipta Banerjee +3 more

Abstract This paper presents reversible implementations of a half adder and a half subtractor suited for Noisy Intermediate-Scale Quantum (NISQ) hardware, described using a minimal gate set such as NOT(X), CNOT(CX), and Toffoli(CCX), and processed in a Qiskit-IBMQ codesign environment. The proposed circuits are compiled and evaluated on the IBM Quantum Brisbane backend. For each computational-basis input, the histograms of measured outcomes reveal a prominent peak consistent with the desired truth table together with non-ideal hardware contributions in the measured distribution. To extend the analysis beyond computational-basis inputs, the superposition state √︁1/3|0⟩+√︁2/3|1⟩ is prepared using a standard parameterized Ry(θ) rotation with θ = 1.910633 rad, and the resulting circuits are evaluated on the IBM Quantum Brisbane backend. Finally, circuit-conditioned relaxation and decoherence are characterized using effective T1 and T2 parameters obtained from exponential fitting, together with reduced-χ2 statistics to assess model consistency.

Engineering Research Express•Nov 11, 2026•0 citations

Design and Optimization of Quantum Arithmetic Circuits for Next-Generation Quantum Systems

Yogeswari Palanisamy, Murugan Kathirvelu, G.B. Mohankumar +3 more

Quantum computing (Q-computing) is a revolutionary technology that applies quantum mechanics (QM) to implement calculations significantly quicker than traditional computers. Q-computing employs Q-bits (qubits) rather than classical bits, which can take on a superposition state, making it possible to represent both 0 and 1 at once. This distinctive property allows qubits to perform multiple calculations simultaneously, making Q computers exponentially more powerful as more qubits are added, compared to the linear scaling of classical computers. However, challenges such as qubit instability and error rates remain significant obstacles to fully realizing this potential. A vital aspect of this technology is the development of Q arithmetic circuits, which act as the foundational blocks for efficiently executing Q algorithms. Q half-adder and full-adder circuits are integral to performing fundamental arithmetic operations within Q computers. In contrast to classical adders, Q adders rely on Q gates such as Controlled NOT (CNOT) and Toffoli gates. These gates exploit Q phenomena like entanglement and superposition, allowing for more efficient computations. The Q half-adder consists of two qubits and adds two single bits, producing a carry and sum output. It utilizes the CNOT gate to compute the sum and the Toffoli gate (controlled-controlled-NOT [CCNOT]) to compute the carry. The Q full-adder builds on this, adding three qubits to produce a sum and a carry output, further increasing computational capacity. Through the entanglement of qubits, these circuits allow for more parallelism and speed compared to classical adders. Q carry-look-ahead adders (QCLAs) and Q ripple-carry adders (QRCAs) are used to perform more complex arithmetic operations based on these half-adder and full-adder structures. Q arithmetic circuits have broad applications, boosting secure key generation in cryptography, speeding up matrix operations for faster model training in machine learning, and enabling more precise, efficient image transformations in Q image processing, benefiting fields like medical imaging and computer vision.

Auerbach Publications eBooks•Feb 24, 2026•0 citations

Design of a Quantum circuit for 4-Qubit multiplier using IBM Quantum Computer

A. Arunkumar Gudivada, Asisa Kumar Panigrahy

Abstract Reversible gates have been one of the emerging research areas in these days. The reversible gates have several applications in the fields of low power CMOS, DNA computing, optical, nanotechnology etc. Quantum computing is one of the fastest and upcoming nanotechnologies that can implement the digital logical circuits using reversible logic gates. In this paper, CNOT, TOFFOLI, FREDKIN and PERES reversible logic gates have been implemented on IBM quantum computer. An efficient one-bit full adder is going to be proposed using the reversible gates like CNOT and TOFFOLI. Later, a 4x4 multiplier will be developed using the proposed one-bit full adder. The proposed multiplier is proved to perform faster calculations compared to the earlier multipliers. The simulation of the presented modules will be done on IBM Quantum computer and the respective probabilities can be observed for different inputs.

•Aug 4, 2022•0 citations
Quantum computing is an emerging computational paradigm that represents and processes information using quantum states. This paper presents the implementation and simulation of a Quantum Half Adder using the IBM Qiskit framework. The proposed circuit performs one-bit binary addition and produces two outputs, SUM and CARRY, through reversible quantum operations. Classical input values are encoded into quantum states using Pauli-X gates. Controlled-NOT (CNOT) gates are used to realize the XOR relationship required for SUM generation, while a Toffoli (CCNOT) gate realizes the AND relationship required for CARRY generation. The complete design is implemented in Python and executed using the Qiskit Aer Simulator. Four possible input combinations are evaluated and the measured outputs are compared with the expected Half Adder truth table. Circuit visualization, terminal output, and measurement histograms are used to verify the operation. The results show that the simulated circuit produces the expected SUM and CARRY values for all input combinations. The work provides a simple practical model for understanding reversible quantum computation, quantum gates, and Qiskit-based quantum circuit simulation.
Quantum computing represents a paradigm shift in computation by leveraging the principles of quantum mechanics such as superposition, entanglement, and interference to perform operations beyond classical limitations. Unlike classical computing systems that rely on irreversible logic operations and suffer from energy dissipation due to information loss, quantum systems utilize reversible unitary transformations that preserve information and improve computational efficiency. This paper presents a comprehensive framework for the design, simulation, and validation of quantum gates and reversible arithmetic circuits, including half adders and half subtractors. The proposed approach systematically maps classical arithmetic logic into quantum circuits using fundamental quantum gates such as Pauli-X, Hadamard, Controlled-NOT (CNOT), and Toffoli gates. The circuits are implemented and simulated using the Qiskit Aer framework, enabling detailed analysis of quantum state evolution and measurement outputs. The results obtained from simulation include program-level outputs, state vector representations, measurement counts, and probability distributions, all of which demonstrate strong agreement with classical truth tables. The analysis confirms the correctness, reversibility, and scalability of the proposed designs. Furthermore, a comparative performance evaluation highlights the advantages of quantum computing over classical approaches in terms of parallelism and energy efficiency. The proposed framework establishes a robust foundation for future implementation of complex Boolean logic and arithmetic operations in quantum systems.
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.
The futuristic computing systems with low power dissipation are of interest among Researchers. Reversible logic provides less power dissipation as well as individual output assignment for each individual input. Hence designing reversible circuits are of great importance which finds significant application in Quantum Computing. It is a kind of computing that performs operations on data using quantum mechanical properties, such as superposition and entanglement. Unlike classical computing, quantum computing works on quantum bits. Qubits are processed by Quantum circuits, the basic building blocks of Quantum Computers. In this paper reversible Quantum arithmetic circuit like half adder, full adder, half subtractor and full subtractor are simulated using IBM Q simulator and the corresponding truth tables are verified.
Abstract This paper presents reversible implementations of a half adder and a half subtractor suited for Noisy Intermediate-Scale Quantum (NISQ) hardware, described using a minimal gate set such as NOT(X), CNOT(CX), and Toffoli(CCX), and processed in a Qiskit-IBMQ codesign environment. The proposed circuits are compiled and evaluated on the IBM Quantum Brisbane backend. For each computational-basis input, the histograms of measured outcomes reveal a prominent peak consistent with the desired truth table together with non-ideal hardware contributions in the measured distribution. To extend the analysis beyond computational-basis inputs, the superposition state √︁1/3|0⟩+√︁2/3|1⟩ is prepared using a standard parameterized Ry(θ) rotation with θ = 1.910633 rad, and the resulting circuits are evaluated on the IBM Quantum Brisbane backend. Finally, circuit-conditioned relaxation and decoherence are characterized using effective T1 and T2 parameters obtained from exponential fitting, together with reduced-χ2 statistics to assess model consistency.
Quantum computing (Q-computing) is a revolutionary technology that applies quantum mechanics (QM) to implement calculations significantly quicker than traditional computers. Q-computing employs Q-bits (qubits) rather than classical bits, which can take on a superposition state, making it possible to represent both 0 and 1 at once. This distinctive property allows qubits to perform multiple calculations simultaneously, making Q computers exponentially more powerful as more qubits are added, compared to the linear scaling of classical computers. However, challenges such as qubit instability and error rates remain significant obstacles to fully realizing this potential. A vital aspect of this technology is the development of Q arithmetic circuits, which act as the foundational blocks for efficiently executing Q algorithms. Q half-adder and full-adder circuits are integral to performing fundamental arithmetic operations within Q computers. In contrast to classical adders, Q adders rely on Q gates such as Controlled NOT (CNOT) and Toffoli gates. These gates exploit Q phenomena like entanglement and superposition, allowing for more efficient computations. The Q half-adder consists of two qubits and adds two single bits, producing a carry and sum output. It utilizes the CNOT gate to compute the sum and the Toffoli gate (controlled-controlled-NOT [CCNOT]) to compute the carry. The Q full-adder builds on this, adding three qubits to produce a sum and a carry output, further increasing computational capacity. Through the entanglement of qubits, these circuits allow for more parallelism and speed compared to classical adders. Q carry-look-ahead adders (QCLAs) and Q ripple-carry adders (QRCAs) are used to perform more complex arithmetic operations based on these half-adder and full-adder structures. Q arithmetic circuits have broad applications, boosting secure key generation in cryptography, speeding up matrix operations for faster model training in machine learning, and enabling more precise, efficient image transformations in Q image processing, benefiting fields like medical imaging and computer vision.
Abstract Reversible gates have been one of the emerging research areas in these days. The reversible gates have several applications in the fields of low power CMOS, DNA computing, optical, nanotechnology etc. Quantum computing is one of the fastest and upcoming nanotechnologies that can implement the digital logical circuits using reversible logic gates. In this paper, CNOT, TOFFOLI, FREDKIN and PERES reversible logic gates have been implemented on IBM quantum computer. An efficient one-bit full adder is going to be proposed using the reversible gates like CNOT and TOFFOLI. Later, a 4x4 multiplier will be developed using the proposed one-bit full adder. The proposed multiplier is proved to perform faster calculations compared to the earlier multipliers. The simulation of the presented modules will be done on IBM Quantum computer and the respective probabilities can be observed for different inputs.