Efficient Quantum Implementation of Majority-Based Full Adder Circuit Using Clifford+T-Group

Abstract

Biswal, Laxmidhar Mondal, Bappaditya Chakraborty, Anindita Rahaman, HafizurThe rapid progress in quantum technologies, as well as quantum algorithms, has paved the way for general-purpose, scalable quantum computers. The single most important challenge to that ambitious goal is the handling of noise. Literally, quantum states are fragile; highly sensitive toward noise which requires regular encoding and decoding of quantum information through quantum error-correcting code (QECC) so as to accomplish fault tolerance. Due to the efficient physical implementation of promising QECC on multiple quantum technologies, the Clifford+T group of Quantum operators is nowadays commonly used for the fault-tolerant Quantum circuit realizations. On the other hand, the majority-based data structure converts a ripple-carry adder into a carry-look ahead adder. In this work, we focus on the implementation of Majority-based 1-bit and n-bit Full Adder (FA) in the fault-tolerant quantum logic circuits. We have also calculated the performance parameters viz. T-count, ancillary cost, and T-depth that connected with the quantum circuit of full adder circuit in fault-tolerant logic.