Now a day’s reversible logic is an attractive research area due to its low power consumption in the area of VLSI circuit design. The reversible logic gate is utilized to optimize power consumption by a feature of retrieving input logic from an output logic because of bijective mapping between input and output. In this manuscript, we design 4:2 and 5:2 reversible compressor circuits using a new ...

This paper presents a heuristic cost minimization approach to synthes­ izing linear reversible circuits. Two bidirectional linear reversible circuit syn­ thesis methods are introduced, the Alternating Elimination with Cost Minimiza­ tion method (AECM) and the Multiple CNOT Gate method (MCG). Al­ gorithms, example syntheses, and extensions to these methods are presented. An MCG variant which inc...

It is well-known that deciding equivalence of logic circuits is a coNP-complete problem. As a corollary, the problem of deciding weak equivalence of reversible circuits, i.e. allowing initialized ancilla bits in the input and ignoring “garbage” ancilla bits in the output, is also coNP-complete. The complexity of deciding strong equivalence, including the ancilla bits, is less obvious and may de...

Reversible computation plays an important role in the synthesis of circuits having application in quantum computing, low power CMOS design, bioinformatics and nanotechnology-based systems. Conventional logic circuits are not reversible. A reversible circuit maps each input vector, into a unique output vector and vice versa. We demonstrate how the well-known and very useful, Toffoli gate can be ...

In his 2003 paper"Towards an algebraic theory of Boolean circuits", Lafont notes that the class of reversible circuits over a set of k truth values is finitely generated when k is odd. He cites a private communication for the proof. The purpose of this short note is to make the content of that communication available.

We define a hexagonal partitioned cellular automaton (HPCA), and study logical universality of a reversible HPCA. We give a specific 64-state reversible HPCA H1, and show that a Fredkin gate can be embedded in this cellular space. Since a Fredkin gate is known to be a universal logic element, logical universality of H1 is concluded. Although the number of states of H1 is greater than those of t...

It is well-known that the Toffoli gate and the negation gate together yield a universal gate set, in the sense that every permutation of {0, 1}n can be implemented as a composition of these gates. Since every bit operation that does not use all of the bits performs an even permutation, we need to use at least one auxiliary bit to perform every permutation, and it is known that one bit is indeed...

Reversible logic gates are very much in demand for the future computing technologies as they are known to produce zero power dissipation under ideal conditions. This paper proposes an improved design of a multiplier using reversible logic gates. Multipliers are very essential for the construction of various computational units of a quantum computer. The quantum cost of a reversible logic circui...

In this paper, we show realization of macrolevel ternary reversible 2-qudit Feynman gate, 3-qudit controlled Feynman gate, and 3-qudit Toffoli gates using ternary reversible 1-qudit gates and 2-qudit Muthukrishnan-Stroud gates, which are theoretically realizable using quantum technology such as liquid ion trap [10]. Then we show the design of ternary reversible multiplexer and demultiplexer usi...