Synthesis of reversible logic circuits has gained great attention during the last decade. Various synthesis techniques have been proposed, some generate optimal solutions (in gate count) and are termed as exact, while others are scalable in the sense that they can handle larger functions but generate sub-optimal solutions. Although scalable synthesis is very much essential for circuit design, e...

Galois Field Sum of Products (GFSOP) leads to efficient multi-valued reversible circuit synthesis using quantum gates. In this paper, we propose a new generalization of ternary Toffoli gate and another new generalized reversible ternary gate with discussion of their quantum realizations. Algorithms for synthesizing ternary GFSOP using quantum cascades of these gates are proposed. In both the sy...

Two methods for Toffoli gate cascade synthesis of reversible logic circuits are presented. One is based on previous work [3], utilizing an ESOP minimization technique and then applying template-matching [10]. The other is based on a QMDD representation of a Toffoli cascade and determining an ordering that implements the desired function. Experimental results are presented showing the feasibilit...

We propose a network of generalized Toffoli gates with multiple EXORs for the realization of reversible functions. If implemented as a quantum circuit, the cost of such gates is shown to be only marginally higher than the cost of a Toffoli gate with a single EXOR and the same number of controls. The main result is a regular synthesis procedure which allows for the creation of asymptotically opt...

Conservative and reversible logic gates are widely known to be compatible with revolutionary computing paradigms such as optical and quantum computing. A fundamental conservative reversible logic gate is the Fredkin gate. This paper presents efficient adder circuits based on the Fredkin gate. Novel full adder circuits using Fredkin gates are proposed which have lower hardware complexity than th...

This paper presents an improved ESOP-based reversible logic synthesis which utilizes cubes shared by multiple outputs and ensures that the implementation of each cube requires just one Toffoli gate. Thus it has the potential of minimizing the gate count and quantum cost. Experimental results show that this technique can reduce the quantum cost up to 75%, compared to the existing algorithm.

Previously, Soeken and Thomsen presented six basic semantics-preserving rules for rewriting reversible logic circuits, defined using the well-known diagrammatic notation of Feynman. While this notation is both useful and intuitive for describing reversible circuits, its shortcomings in generality complicates the specification of more sophisticated and abstract rewriting rules. In this paper, we...

A set of p-valued logic gates (primitives) is called universal if an arbitrary p-valued logic function can be realized by a logic circuit built up from a finite number of gates belonging to this set. In the paper, we consider the problem of determining the number of universal single-element sets of ternary reversible logic gates with two inputs and two outputs. We have established that over 97%...

This paper presents a new approach for converting a ternary reversible circuit implemented from a truth table into an online testable circuit. Our approach adds three extra lines to the given circuit, inserts Feynman gates and M-S gates, and replaces the ternary Toffoli gates (KP-m gates) with TKP-(m+1) gates. Our approach works with only 2×2 gates and 1×1 gates and covers a higher number of de...

The reversible logic can be used in various research areas, e. g. quantum computation, cryptography and signal processing. In the paper we study reversible logic circuits with additional inputs, which consist of NOT, CNOT and C2NOT gates. We consider a set F (n, q) of all transformations Bn → Bn that can be realized by reversible circuits with (n+q) inputs. An analogue of Lupanov’s method for t...