An efficient design of reversible ternary full-adder/full-subtractor with low quantum cost

Abstract

One of the major challenges of VLSI circuits is heat caused by energy loss. One of the successful solutions to this challenge is to design circuits in a reversible manner. Hence, the design of reversible circuits has attracted the attention of many researchers in the fields of low-power circuits design, DNA computing and quantum computing. Due to the benefits of ternary logic over binary logic such as reducing the complexity of interconnecting circuits, decreasing the occupied surface and reducing the number of quantum cells in quantum circuits, the ternary logic has been proposed for the design of VLSI circuits. In this paper, we first propose a new reversible ternary full-adder, called comprehensive reversible ternary full-adder, using the ternary logic capabilities. In the following, an efficient reversible ternary full-subtractor is provided. Finally, using the two proposed circuits, a new reversible ternary full-adder/full-subtractor is introduced. The results of the comparisons show that the proposed circuits have lower quantum cost and are more efficient than the other previous circuits.