Optimizing T and CNOT Gates in Quantum Ripple-Carry Adders and Comparators
Maxime Remaud · 2024
The state of the art of quantum circuits using the ripple-carry strategy for the addition and comparison of two n-bit numbers is presented, as well as optimizations in the Clifford+ Math 1 gate set, both in terms of Math 2 -depth and Math 3 -depth, or Math 4 -count and Math 5 -count. In particular, we consider the adders presented by Cuccaro et al. and Takahashi et al., and exhibit an adder with a Math 6 -depth of 3n and a Math 7 -depth of 8n, while without optimization of the original circuits, a Math 8 -depth of 6n is expected. Note that we have focused here on quantum ripple-carry adders using at most one ancilla, without any approximation of the 3-qubit gates involved (Toffoli, Peres and TR) or any strategy involving a measurement.