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

Scientific Reports

Design of a fault‑tolerant‑metric‑aware, reversible n‑bit quantum arithmetic logic unit using IBM Qiskit

Agniswar Banerjee

Published May 20, 2026• 0 citations
Publisher

Abstract

Quantum arithmetic and logic units (QALUs) are useful building blocks for reversible arithmetic subroutines, but broad-operation QALUs with explicit status outputs are rarely evaluated in a way that simultaneously emphasizes reversibility, reproducibility, hardware realism, and Clifford + T resource metrics. A reversible n-bit QALU implemented in Qiskit that supports 16 ALU-style operations is presented, including ADD, SUB, CMP, AND/OR/XOR and their negations, unary NOT, shifts, rotates, and operand passthrough, while preserving the input operands, writing the selected result to a separate result register, and emitting N, Z, C, V as well as EQ, LT u , LT s outputs. The implementation uses compile-time operation-specialized circuits rather than a runtime opcode-decoded super circuit, enabling clean verification and per-operation resource accounting. Exhaustive Aer verification at n = 4 covers all 256 input pairs for each of 16 operations (4096 cases total) and reports zero mismatches against a classical reference model. After decomposition to a Clifford + T-style basis, the arithmetic family (ADD, SUB, CMP) forms the dominant cost tier with T-count 86, CX-count 102–106, and depth 138 on the n = 4 instances, whereas logic and data-movement operations fall into lower-cost tiers. Hardware experiments on IBM Quantum are limited to n = 2 and use dynamical decoupling, gate twirling, and post hoc readout mitigation with mthree; the exhaustive 256-circuit campaign yields 91.41% raw correctness and 91.02% mitigated correctness, showing that suppression is useful, but that mitigation does not necessarily improve end-to-end accuracy at this scale. The contribution of the paper is therefore a reproducible Qiskit realization and evaluation framework for a flagged reversible QALU with Clifford + T-aware metrics, rather than a claim of a new asymptotically optimal arithmetic architecture.

DOI
10.1038/s41598-026-53845-1

Related papers

Resource-Efficient Modular Quantum Arithmetic Logic Unit with Clifford+T Optimization for Quantum Nanoelectronic Systems

P. Sowmithri, N. Roshitha, K. Santhi Priya, M. Manoj Kumar, K. Harika and M. Prakash

ABSTRACT Quantum arithmetic is a basic computational layer for reversible processing in quantum processors, yet its implementation cost grows rapidly with operand width and multi-qubit gate requirements. This paper presents a modular quantum arithmetic and logic unit (QALU) designed with resource-aware reversible primitives and Clifford+T decomposition. The architecture separates addition, subtraction, multiplication, and division into reusable submodules and evaluates their circuit cost in terms of T-count, T-depth, CNOT-count, CNOT-depth, qubit width, and total gate count. Hermitian LI gates and approximate Toffoli decompositions are incorporated to reduce redundant non-Clifford operations and circuit depth. The circuits are constructed and validated in Qiskit for small operand sizes, followed by symbolic resource analysis for scalable forms. For the demonstrated instances, the optimized adder is reduced from 10 to 7 total gates, the subtractor from 9 to 5, the multiplier from 12 to 8, and the divider from 11 to 6, while preserving the intended arithmetic mappings. The resulting modular framework provides a compact circuit-level approach for quantum arithmetic and is relevant to emerging quantum technology and quantum nanoelectronic systems where qubit count and fault-tolerant gate overhead are critical design constraints. Key words: quantum arithmetic, quantum ALU, reversible logic, Clifford+T, Hermitian LI gate, approximate Toffoli, Qiskit, quantum nanoelectronics.

International Journal of Emerging Trends in Engineering and Development•Nov 6, 2026•0 citations

A New Quantum Efficient Fault Tolerant Parity Preserving Clifford + T ALU

Shekoofeh Moghimi, Mohammad Reza Reshadinezhad, Antonio Rubio

Reversible logic is characterized by its feature of being a prominent application in low-power conventional computers and the most compatible logic in quantum computers. Quantum circuits executes quantum algorithms and are important in a new generation of advanced computing. However, they are highly error-prone and also subject to the use of limited and sensitive physical resources like qubits and quantum gates. This paper introduces a comprehensive fault tolerant quantum-based reversible circuit which can calculate a high variety number of arithmetic and logic operations. It uses both: parity preserving method for detecting one or an odd number of bit errors, and Clifford + T implementation for protecting circuits against decoherence faults. First, we propose a new fault-tolerant (parity preserving and Clifford + T) adder/subtractor and derive a quantum reversible Arithmetic and Logic Unit (ALU). These modules reach the most optimized extent of circuit line, ancilla inputs, and garbage outputs according to the logical analysis done in this work. This article focuses on reducing T-cost metrics in conjunction with enhancing the number of operations and quantum costs in proposed circuits compared to other counterparts. We propose 4-bit fault tolerant ALU derived from our proposed single-bit module to show the proposed circuit can be extended to any larger size. The proposed circuit is implemented in the Qiskit simulation tool, and output results confirm the accuracy of our design functionality. The proposed full adder/ subtractor achieves an average of 64% and 43%, and the proposed ALU circuit achieves an average of 38% and 27% improvement in T-count and T-depth, respectively compared to their counterparts. The proposed reversible quantum-optimized fault tolerant adder/subtractor and ALU units can be applied as the basic part of DSP systems and quantum processor units in quantum computing devices.

IEEE Transactions on Emerging Topics in Computing•Apr 1, 2026•0 citations

Minimizing Quantum Overhead: A Fault-Tolerant ALU Design with Reduced T Metrics

Sarallah Keshavarz, Shekoofeh Moghimi, Mohammad Reza Reshadinezhad

Quantum Arithmetic Logic Units (ALUs) serve as critical components in quantum processors, enabling both arithmetic and logical operations on qubits. However, the fragile nature of quantum systems makes them susceptible to errors and decoherence, necessitating fault-tolerant designs. In this work, we propose a fault-tolerant quantum ALU architecture constructed using the Clifford+ T gate set, which is widely recognized for its compatibility with error-correcting codes. The proposed design minimizes quantum resource overhead while maintaining computational accuracy under fault-prone conditions. Notably, the architecture requires zero ancilla and generates a single garbage output, optimizing the qubit space. Performance evaluations demonstrate significant improvements, achieving a 31.8% reduction in T-count and a 33.3% reduction in T-depth compared to existing designs. These enhancements contribute to more efficient and reliable quantum computation, paving the way for scalable quantum processor development.

International Conference on Computer and Knowledge Engineering•Oct 28, 2025•0 citations

Design of a Fault-Tolerant BCD to Excess-3 Code Converter Using Clifford+T Quantum Gates

Sandip Das, Shankar Prasad Mitra, Sushmita Chaudhari +1 more

Quantum computing has the potential to transform modern computation by offering exponential advantages in areas such as cryptography, optimization, and intelligent data processing. To effectively realize these advantages, particularly in fault-tolerant and Noisy Intermediate-Scale Quantum (NISQ) environments, quantum circuits must be both resource-efficient and error-resilient. This paper presents a novel Binary-Coded Decimal (BCD) to Excess-3 code converter designed exclusively using the Clifford+T gate set, which is widely supported by fault-tolerant quantum hardware. The proposed design eliminates conventional 4-bit reversible adder-based implementations and instead employs an optimized logic structure based on Clifford+T-decomposed Peres gates. By leveraging Temporary Logical-AND gates and CNOT operations, the circuit achieves reduced T-count, circuit depth, and quantum cost as key metrics in fault-tolerant quantum computation. Functional correctness is verified through IBM Qiskit, Version 2.1 simulations for all valid BCD inputs. The proposed converter serves as a scalable and hardware-compatible arithmetic building block for resource-aware and AI-oriented quantum architectures.

International Electronic Conference on Applied Sciences (ASEC)•Feb 4, 2026•2 citations

Efficient T-Count Fault-tolerant Quantum Clifford+T Multiplexer

Negin Mashayekhi, Shekoofeh Moghimi, Mohammad Reza Reshadinezhad

Reversible logic is essential in quantum computing due to its ability to preserve information and establish a one-to-one mapping between inputs and outputs. The Clifford+T gate set, known for supporting fault-tolerant quantum circuits, offers resilience against decoherence but introduces high implementation costs, particularly due to the T gate's resource intensity. In this work, we propose a new and efficient quantum multiplexer design, the Quantum Clifford T-MUX, designed entirely within the Clifford+T framework. This multiplexer minimizes T-count and avoids the use of ancillary qubits, both critical factors for practical, fault-tolerant quantum computing. As part of this architecture, we present a newly designed fault-tolerant Peres gate using only Clifford+T gates, which serves as a fundamental building block in the T-MUX construction. The proposed T-MUX achieves reduced T-count, no garbage output, and improved efficiency compared to traditional designs. These improvements position it as a valuable component for building scalable quantum Arithmetic Logic Units (ALUs), data buses, and memory systems. Overall, this work contributes toward the development of low-overhead, modular quantum control structures suited for near-term and long-term quantum computing architectures. The proposed circuit is simulated using the Quirk online tool, and the result confirms the accuracy of the design. This design achieves an average 35% improvement in T-Count without any constant input, compared to its counterpart, respectively.

International Conference on Computer and Knowledge Engineering•Oct 28, 2025•0 citations

Improved quantum circuits for division

Priyanka Mukhopadhyay, Alexandru Gheorghiu, Hari Krovi

Arithmetic operations are an important component of many quantum algorithms. Optimizing quantum circuits for these operations therefore leads to more efficient implementations of the corresponding algorithms. In this paper, we develop new fault-tolerant quantum circuits for various integer division algorithms (both reversible and non-reversible). These circuits, when implemented in the Clifford+T gate set, achieve improvements in the asymptotic T-count and CNOT-count from $O(n^2)$ to $O(nm)$, and in the asymptotic T-depth from $O(n^2)$ to $O(n \log m)$, where $n$ and $m$ are the bit lengths of the dividend and divisor, respectively. The qubit counts are significantly lower than those in previous works. We achieve this through careful modifications of the division algorithms and by expressing them in terms of a primitive we call COMP-N-SUB that compares two integers and conditionally subtracts them. We show that this primitive can be implemented at a cost, in terms of both Clifford and non-Clifford gates, comparable to that of one addition. By contrast, performing comparison and conditional subtraction separately would cost roughly as much as a controlled addition plus a regular addition.

quant-pharXiv:2603.18110•Mar 19, 2026•1 citation
Quantum arithmetic and logic units (QALUs) are useful building blocks for reversible arithmetic subroutines, but broad-operation QALUs with explicit status outputs are rarely evaluated in a way that simultaneously emphasizes reversibility, reproducibility, hardware realism, and Clifford + T resource metrics. A reversible n-bit QALU implemented in Qiskit that supports 16 ALU-style operations is presented, including ADD, SUB, CMP, AND/OR/XOR and their negations, unary NOT, shifts, rotates, and operand passthrough, while preserving the input operands, writing the selected result to a separate result register, and emitting N, Z, C, V as well as EQ, LT u , LT s outputs. The implementation uses compile-time operation-specialized circuits rather than a runtime opcode-decoded super circuit, enabling clean verification and per-operation resource accounting. Exhaustive Aer verification at n = 4 covers all 256 input pairs for each of 16 operations (4096 cases total) and reports zero mismatches against a classical reference model. After decomposition to a Clifford + T-style basis, the arithmetic family (ADD, SUB, CMP) forms the dominant cost tier with T-count 86, CX-count 102–106, and depth 138 on the n = 4 instances, whereas logic and data-movement operations fall into lower-cost tiers. Hardware experiments on IBM Quantum are limited to n = 2 and use dynamical decoupling, gate twirling, and post hoc readout mitigation with mthree; the exhaustive 256-circuit campaign yields 91.41% raw correctness and 91.02% mitigated correctness, showing that suppression is useful, but that mitigation does not necessarily improve end-to-end accuracy at this scale. The contribution of the paper is therefore a reproducible Qiskit realization and evaluation framework for a flagged reversible QALU with Clifford + T-aware metrics, rather than a claim of a new asymptotically optimal arithmetic architecture.
ABSTRACT Quantum arithmetic is a basic computational layer for reversible processing in quantum processors, yet its implementation cost grows rapidly with operand width and multi-qubit gate requirements. This paper presents a modular quantum arithmetic and logic unit (QALU) designed with resource-aware reversible primitives and Clifford+T decomposition. The architecture separates addition, subtraction, multiplication, and division into reusable submodules and evaluates their circuit cost in terms of T-count, T-depth, CNOT-count, CNOT-depth, qubit width, and total gate count. Hermitian LI gates and approximate Toffoli decompositions are incorporated to reduce redundant non-Clifford operations and circuit depth. The circuits are constructed and validated in Qiskit for small operand sizes, followed by symbolic resource analysis for scalable forms. For the demonstrated instances, the optimized adder is reduced from 10 to 7 total gates, the subtractor from 9 to 5, the multiplier from 12 to 8, and the divider from 11 to 6, while preserving the intended arithmetic mappings. The resulting modular framework provides a compact circuit-level approach for quantum arithmetic and is relevant to emerging quantum technology and quantum nanoelectronic systems where qubit count and fault-tolerant gate overhead are critical design constraints. Key words: quantum arithmetic, quantum ALU, reversible logic, Clifford+T, Hermitian LI gate, approximate Toffoli, Qiskit, quantum nanoelectronics.
Reversible logic is characterized by its feature of being a prominent application in low-power conventional computers and the most compatible logic in quantum computers. Quantum circuits executes quantum algorithms and are important in a new generation of advanced computing. However, they are highly error-prone and also subject to the use of limited and sensitive physical resources like qubits and quantum gates. This paper introduces a comprehensive fault tolerant quantum-based reversible circuit which can calculate a high variety number of arithmetic and logic operations. It uses both: parity preserving method for detecting one or an odd number of bit errors, and Clifford + T implementation for protecting circuits against decoherence faults. First, we propose a new fault-tolerant (parity preserving and Clifford + T) adder/subtractor and derive a quantum reversible Arithmetic and Logic Unit (ALU). These modules reach the most optimized extent of circuit line, ancilla inputs, and garbage outputs according to the logical analysis done in this work. This article focuses on reducing T-cost metrics in conjunction with enhancing the number of operations and quantum costs in proposed circuits compared to other counterparts. We propose 4-bit fault tolerant ALU derived from our proposed single-bit module to show the proposed circuit can be extended to any larger size. The proposed circuit is implemented in the Qiskit simulation tool, and output results confirm the accuracy of our design functionality. The proposed full adder/ subtractor achieves an average of 64% and 43%, and the proposed ALU circuit achieves an average of 38% and 27% improvement in T-count and T-depth, respectively compared to their counterparts. The proposed reversible quantum-optimized fault tolerant adder/subtractor and ALU units can be applied as the basic part of DSP systems and quantum processor units in quantum computing devices.
Quantum Arithmetic Logic Units (ALUs) serve as critical components in quantum processors, enabling both arithmetic and logical operations on qubits. However, the fragile nature of quantum systems makes them susceptible to errors and decoherence, necessitating fault-tolerant designs. In this work, we propose a fault-tolerant quantum ALU architecture constructed using the Clifford+ T gate set, which is widely recognized for its compatibility with error-correcting codes. The proposed design minimizes quantum resource overhead while maintaining computational accuracy under fault-prone conditions. Notably, the architecture requires zero ancilla and generates a single garbage output, optimizing the qubit space. Performance evaluations demonstrate significant improvements, achieving a 31.8% reduction in T-count and a 33.3% reduction in T-depth compared to existing designs. These enhancements contribute to more efficient and reliable quantum computation, paving the way for scalable quantum processor development.
Quantum computing has the potential to transform modern computation by offering exponential advantages in areas such as cryptography, optimization, and intelligent data processing. To effectively realize these advantages, particularly in fault-tolerant and Noisy Intermediate-Scale Quantum (NISQ) environments, quantum circuits must be both resource-efficient and error-resilient. This paper presents a novel Binary-Coded Decimal (BCD) to Excess-3 code converter designed exclusively using the Clifford+T gate set, which is widely supported by fault-tolerant quantum hardware. The proposed design eliminates conventional 4-bit reversible adder-based implementations and instead employs an optimized logic structure based on Clifford+T-decomposed Peres gates. By leveraging Temporary Logical-AND gates and CNOT operations, the circuit achieves reduced T-count, circuit depth, and quantum cost as key metrics in fault-tolerant quantum computation. Functional correctness is verified through IBM Qiskit, Version 2.1 simulations for all valid BCD inputs. The proposed converter serves as a scalable and hardware-compatible arithmetic building block for resource-aware and AI-oriented quantum architectures.
Reversible logic is essential in quantum computing due to its ability to preserve information and establish a one-to-one mapping between inputs and outputs. The Clifford+T gate set, known for supporting fault-tolerant quantum circuits, offers resilience against decoherence but introduces high implementation costs, particularly due to the T gate's resource intensity. In this work, we propose a new and efficient quantum multiplexer design, the Quantum Clifford T-MUX, designed entirely within the Clifford+T framework. This multiplexer minimizes T-count and avoids the use of ancillary qubits, both critical factors for practical, fault-tolerant quantum computing. As part of this architecture, we present a newly designed fault-tolerant Peres gate using only Clifford+T gates, which serves as a fundamental building block in the T-MUX construction. The proposed T-MUX achieves reduced T-count, no garbage output, and improved efficiency compared to traditional designs. These improvements position it as a valuable component for building scalable quantum Arithmetic Logic Units (ALUs), data buses, and memory systems. Overall, this work contributes toward the development of low-overhead, modular quantum control structures suited for near-term and long-term quantum computing architectures. The proposed circuit is simulated using the Quirk online tool, and the result confirms the accuracy of the design. This design achieves an average 35% improvement in T-Count without any constant input, compared to its counterpart, respectively.
Arithmetic operations are an important component of many quantum algorithms. Optimizing quantum circuits for these operations therefore leads to more efficient implementations of the corresponding algorithms. In this paper, we develop new fault-tolerant quantum circuits for various integer division algorithms (both reversible and non-reversible). These circuits, when implemented in the Clifford+T gate set, achieve improvements in the asymptotic T-count and CNOT-count from O(n2)O(n^2)O(n2) to O(nm)O(nm)O(nm), and in the asymptotic T-depth from O(n2)O(n^2)O(n2) to O(nlog⁡m)O(n \log m)O(nlogm), where nnn and mmm are the bit lengths of the dividend and divisor, respectively. The qubit counts are significantly lower than those in previous works. We achieve this through careful modifications of the division algorithms and by expressing them in terms of a primitive we call COMP-N-SUB that compares two integers and conditionally subtracts them. We show that this primitive can be implemented at a cost, in terms of both Clifford and non-Clifford gates, comparable to that of one addition. By contrast, performing comparison and conditional subtraction separately would cost roughly as much as a controlled addition plus a regular addition.