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.
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 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 fast development is leading to the emergence of a wide variety of software development frameworks. In general, in these frameworks users can implement quantum algorithms and circuits, evaluating their behavior through simulations, and in some cases, executing them on Noisy Intermediate-Scale Quantum (NISQ) devices. IBM has been a pioneer in this field, providing public access to their devices through the IBM Q Experience Platform, using Python's open-source framework Qiskit. In this paper, we present the development of a n-bitstring half-adder and half-subtractor algorithm in Qiskit, analyzing the behavior on the IBM Q Experience simulator and real quantum processors.
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.
Quantum counters are very crucial elements in the design of quantum sequential circuits and quantum control systems. This article details the design, implementation, and noise-aware benchmarking of large-scale quantum counter designs based on the Qiskit framework and IBM Quantum computing platforms. The quantum counter architectures introduced are 2-bit, 3-bit, 4-bit, and 5-bit quantum counters which are developed using reversible quantum gates like Pauli-X, Controlled-NOT (CNOT), Toffoli, and Multi-Controlled X (MCX) gates. Firstly, all the counter architectures were confirmed to be working well in the ideal simulation scenario using the Qiskit Aer simulator where they achieved perfect computational fidelity and produced correct counting sequences. For the assessment of practical performance in the Noisy Intermediate-Scale Quantum (NISQ) environment, several quantum noise models, including bit-flip noise, depolarizing noise, amplitude damping noise, and phase damping noise, were introduced within the experimental framework. The experimental findings indicate that as circuits become more complex, the precision of computations decreases in the presence of real-world noise conditions. Under bit-flip noise, the correct counts noted changed from 846 for the 2-bit counter to 620 for the 5-bit counter. Likewise, depolarizing noise led to a slight decline, whereas amplitude damping noise resulted in the most drastic decrease in performance, dropping the correct counts from 253 in the 2-bit design to merely 33 in the 5-bit design. On the contrary, a phase damping noise showed almost no impact and retained 1024 correct counts across all architectures. The scalability analysis demonstrates that quantum counter architectures based on reversible gates can proficiently work over quite extensive qubit configurations while maintaining functional correctness. Nevertheless, the increase in circuit depth and gate complexity mainly results in susceptibility to decoherence and noise accumulation. This work offers a unified framework for the development and evaluation of large-scale quantum sequential circuits and sheds light on building quantum systems that can be used fault-tolerantly in future quantum computing implementations.
Quantum counters are crucial elements in the design of quantum sequential circuits and quantum control systems. This article details the design, implementation, and noise-aware benchmarking of large-scale quantum counter designs based on the Qiskit framework and IBM Quantum computing platforms. The quantum counter architectures introduced are 2-bit, 3-bit, 4-bit, and 5-bit quantum counters, which are developed using reversible quantum gates like Pauli-X, Controlled-NOT (CNOT), Toffoli, and Multi-Controlled X (MCX) gates. Firstly, all the counter architectures were confirmed to be working well in the ideal simulation scenario using the Qiskit Aer simulator, where they achieved perfect computational fidelity and produced correct counting sequences. For the assessment of practical performance in the Noisy Intermediate-Scale Quantum (NISQ) environment, several quantum noise models, including bit-flip noise, depolarizing noise, amplitude damping noise, and phase damping noise, were introduced within the experimental framework. The experimental findings indicate that as circuits become more complex, the precision of computations decreases in the presence of real-world noise conditions. Under bit-flip noise, the correct counts decreased from 846 for the 2-bit counter to 620 for the 5-bit counter. Likewise, depolarizing noise led to a slight decline, whereas amplitude damping noise resulted in the most drastic decrease in performance, dropping the correct counts from 253 in the 2-bit design to merely 33 in the 5-bit design. On the contrary, phase damping noise showed almost no impact and retained 1,024 correct counts across all architectures. The scalability analysis demonstrates that quantum counter architectures based on reversible gates can proficiently work over quite extensive qubit configurations while maintaining functional correctness. Nevertheless, the increase in circuit depth and gate complexity mainly results in susceptibility to decoherence and noise accumulation. This work offers a unified framework for the development and evaluation of large-scale quantum sequential circuits and sheds light on building quantum systems that can be used fault-tolerantly in future quantum computing implementations.
In this work, we develop quantum reversible counterparts of the logical AND, NAND, OR, NOR, and XOR gates within a single architectural template: a quantum Fourier transform (QFT)–based adder that emulates a digital half‐adder by computing the sum and carry of two input bits. Each member of the gate family is obtained from the same adder by inserting only X and SWAP gates as pre‐ and postprocessing steps, with the required Boolean identities supplied by De Morgan’s laws. We prove that every proposed circuit is unitary prior to readout, so the input data remain recoverable from the output state. The construction generalizes to N ‐input gates through an in‐place population‐count (Hamming‐weight) register, and we derive explicitly that the resulting qubit requirement is N + log 2 N , compared with the 2 N − 1 qubits of the standard Toffoli‐ladder synthesis; the derivation is validated by exhaustive simulation for N ≤ 8. We provide a comprehensive resource analysis‐qubit count, gate count, circuit depth, CX count, T count, transpiled depth, and success probability‐against Toffoli‐, CNOT‐, and X‐gate‐based reversible circuits as well as three multicontrolled‐NOT decompositions with different ancilla‐depth trade‐offs. The analysis shows that the qubit saving is obtained at the price of a larger two‐qubit‐gate count, and identifies the regimes in which the QFT‐based design is advantageous. All two‐input gates and a four‐input NAND instance are executed for every input combination on IBM quantum hardware and on a calibrated noise‐model simulator, and the measured outputs consistently reproduce the corresponding truth tables, with hardware success probabilities of 0.97–0.99 for the two‐input gates and 0.88–0.93 for the four‐input NAND.