T-count and Qubit Optimized Quantum Circuit Designs of Carry Lookahead Adder

TL;DR

This paper introduces two optimized quantum carry lookahead adder designs focusing on reducing T-count and qubit usage, achieving significant T gate savings compared to existing designs.

Contribution

It presents novel QCLA designs optimized for T-count and qubit cost, with in-place and out-of-place variants, improving efficiency over prior work.

Findings

Out-of-place QCLAs reduce T-count by up to 54.34%.

In-place QCLAs achieve T-count savings of up to 72.11%.

Proposed designs outperform existing QCLAs in T-count reduction.

Abstract

Quantum circuits of arithmetic operations such as addition are needed to implement quantum algorithms in hardware. Quantum circuits based on Clifford+T gates are used as they can be made tolerant to noise. The tradeoff of gaining fault tolerance from using Clifford+T gates and error correcting codes is the high implementation overhead of the T gate. As a result, the T-count performance measure has become important in quantum circuit design. Due to noise, the risk for errors in a quantum circuit computation increases as the number of gate layers (or depth) in the circuit increases. As a result, low depth circuits such as quantum carry lookahead adders (QCLA)s have caught the attention of researchers. This work presents two QCLA designs each optimized with emphasis on T-count or qubit cost respectively. In-place and out-of-place versions of each design are shown. The proposed QCLAs are compared against the existing works in terms of T-count. The proposed QCLAs for out-of-place addition achieve average T gate savings of $54.34 \%$ and $37.21 \%$, respectively. The proposed QCLAs for in-place addition achieve average T gate savings of $72.11 \%$ and $35.87 \%$