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

Advances in intelligent systems and computing

Fault-Tolerant Implementation of Quantum Arithmetic and Logical Unit (QALU) Using Clifford+T-Group

Laxmidhar Biswal, Chandan Bandyopadhyay, Sudip Ghosh, Hafizur Rahaman

Published Nov 23, 2020• 5 citations
Publisher
DOI
10.1007/978-981-15-7834-2_78

Related papers

T-count and T-depth efficient fault-tolerant quantum arithmetic and logic unit

Sarallah Keshavarz, Mohammad Reza Reshadinezhad, Shekoofeh Moghimi

Quantum Information Processing•Jun 24, 2024•10 citations

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

Agniswar Banerjee

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.

Scientific Reports•May 20, 2026•0 citations

Fault-Tolerant Quantum Realization of Nikhilam Multiplier with Clifford+T-group

Laxmidhar Biswal, Anirban Bhattacharjee, Chandan Bandyopadhyay +1 more

SN Computer Science•Jan 23, 2026•1 citation

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 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

No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits

Aranya Chakraborty, Daniel Gottesman

Identifying stabilizer codes that admit fault-tolerant implementations of the full logical Clifford group would significantly advance fault-tolerant quantum computation. Motivated by this goal, we study several classes of fault-tolerant gadget constructions consisting of Clifford gates acting on the physical qubits, including transversal gadgets, code automorphisms, and fold-transversal gadgets. While stabilizer codes encoding a single logical qubit, most notably the [[7,1,3]] Steane code, are known to admit transversal implementations of the full logical Clifford group, no analogous examples are known for codes encoding multiple logical qubits. In this work, we prove a no-go theorem establishing that no stabilizer code admits a fully transversal implementation of the Clifford group on more than one logical qubit. We further strengthen this result by showing that fold-transversal implementations of the full logical Clifford group are impossible for stabilizer codes encoding more than two logical qubits. More generally, we introduce the notion of k-fold transversal gadgets and prove that implementing the full Clifford group on k logical qubits requires at least k-fold transversal gadgets at the physical level. In addition, we analyze code-automorphism based constructions and demonstrate that they also fail to realize the full Clifford group on multiple logical qubits for any stabilizer code. Together, these results place fundamental constraints on fault-tolerant Clifford gadget design and show that stabilizer codes supporting the full logical Clifford group on multiple logical qubits via these architectures do not exist. Since the Clifford group is a core component of universal gate sets, our findings imply that quantum computing with codes encoding multiple logical qubits within a single code block necessarily entails more complex constructions for fault tolerance.

quant-pharXiv:2602.13395•PRX Quantum•Feb 17, 2026•16 citations
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.
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.
Identifying stabilizer codes that admit fault-tolerant implementations of the full logical Clifford group would significantly advance fault-tolerant quantum computation. Motivated by this goal, we study several classes of fault-tolerant gadget constructions consisting of Clifford gates acting on the physical qubits, including transversal gadgets, code automorphisms, and fold-transversal gadgets. While stabilizer codes encoding a single logical qubit, most notably the [[7,1,3]] Steane code, are known to admit transversal implementations of the full logical Clifford group, no analogous examples are known for codes encoding multiple logical qubits. In this work, we prove a no-go theorem establishing that no stabilizer code admits a fully transversal implementation of the Clifford group on more than one logical qubit. We further strengthen this result by showing that fold-transversal implementations of the full logical Clifford group are impossible for stabilizer codes encoding more than two logical qubits. More generally, we introduce the notion of k-fold transversal gadgets and prove that implementing the full Clifford group on k logical qubits requires at least k-fold transversal gadgets at the physical level. In addition, we analyze code-automorphism based constructions and demonstrate that they also fail to realize the full Clifford group on multiple logical qubits for any stabilizer code. Together, these results place fundamental constraints on fault-tolerant Clifford gadget design and show that stabilizer codes supporting the full logical Clifford group on multiple logical qubits via these architectures do not exist. Since the Clifford group is a core component of universal gate sets, our findings imply that quantum computing with codes encoding multiple logical qubits within a single code block necessarily entails more complex constructions for fault tolerance.