A Quantum Cost 9 Reversible Full Adder with Single-Toffoli Complexity

Read full text
Authors: G Papakonstantinou
Cited by: 1

Abstract

The minimization of Quantum Cost (QC), specifically the number of Toffoli gates, is a primary objective in the synthesis of reversible arithmetic circuits. For decades, the Peres Full Adder has been considered the benchmark for minimal realizations, requiring 2 Toffoli gates and a Quantum Cost of 12. In this note, we propose a novel reversible Full Adder circuit that utilizes only one Toffoli gate and four CNOT gates. The proposed design achieves a Quantum Cost of 9, representing a 25% reduction compared to the Peres structure, while maintaining a competitive logical depth of 4. We rigorously verify the logic and demonstrate that the reduction is achieved through the automated synthesis framework recently proposed by the authors.

Fields of Study & Subjects

Quantum Computing Algorithms and Architecture Quantum-Dot Cellular Automata Low-power high-performance VLSI design

Publication details

Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication date
27 January 2026
Document type
Preprint