Ancilla-free Quantum Adder with Sublinear Depth

TL;DR

This paper introduces the first exact quantum adder with sublinear depth that operates without ancilla qubits, using classical reversible logic to achieve efficient addition of n-bit numbers.

Contribution

It presents a novel ancilla-free quantum adder with depth O(log^2 n), replacing ladder circuits with low-depth equivalents, and extends this to incrementing and constant addition.

Findings

Achieves quantum addition in depth O(log^2 n) without ancilla qubits.

Replaces ladder of CNOT and Toffoli gates with low-depth circuits.

Provides new constructions for incrementing and adding constants.

Abstract

We present the first exact quantum adder with sublinear depth and no ancilla qubits. Our construction is based on classical reversible logic only and employs low-depth implementations for the CNOT ladder operator and the Toffoli ladder operator, two key components to perform ripple-carry addition. Namely, we demonstrate that any ladder of $n$ CNOT gates can be replaced by a CNOT-circuit with $O(\log n)$ depth, while maintaining a linear number of gates. We then generalize this construction to Toffoli gates and demonstrate that any ladder of $n$ Toffoli gates can be substituted with a circuit with $O(\log^2 n)$ depth while utilizing a linearithmic number of gates. This builds on the recent works of Nie et al. and Khattar and Gidney on the technique of conditionally clean ancillae. By combining these two key elements, we present a novel approach to design quantum adders that can perform the addition of two $n$-bit numbers in depth $O(\log^2 n)$ without the use of any ancilla and using classical reversible logic only (Toffoli, CNOT and X gates). We also present new constructions for incrementing and adding a constant to a quantum register.