Implementation of three efficient 4-digit fault-tolerant quantum carry lookahead adders

Adders are one of the most interesting circuits in quantum computing due to their use in major algorithms that benefit from the special characteristics of this type of computation. Among these algorithms, Shor's algorithm stands out, which allows decomposing numbers in a time exponentially lower than the time needed to do it with classical computation. In this work, we propose three fault-tolerant carry lookahead adders that improve the cost in terms of quantum gates and qubits with respect to the rest of quantum circuits available in the literature. Their optimal implementation in a real quantum computer is also presented. Finally, the work ends with a rigorous comparison where the advantages and disadvantages of the proposed circuits against the rest of the circuits of the state of the art are exposed. Moreover, the information obtained from such a comparison is summarized in tables that allow a quick consultation to interested researchers.

Automated summary

In this work, three fault-tolerant carry lookahead adders are proposed, which improve the cost in terms of quantum gates and qubits compared to existing circuits. A rigorous comparison of the proposed circuits against the state of the art is also presented.