Novel methods for reversible logic synthesis and their application to quantum computing

• Authors: Marek A. Perkowski;Anas Naser Essa Al-Rabadi
• Venue: Novel methods for reversible logic synthesis and their application to quantum computing
• Year: 2002

The biggest problems in system design today, and in the future, are the high rate of power consumption, and the emergence of quantum effects for highly dense ICs. The real challenge is to design reliable systems that consume as little power as possible and in which the signals are processed and transmitted at very high speeds with very high signal integrity. Current tools are used to design ICs using only classical design methodologies that apply conventional synthesis constraints such as area, delay, and power. As it was proven, physical processes have to be logically reversible in order to reduce (theoretically eliminate) power consumption. Logical reversibility requires that one can obtain the vector of inputs from the vector of outputs (i.e., backward process) as well as the vector of outputs from the vector of inputs (i.e., forward process). Since only ad-hoc methods were used previously for the reversible synthesis of logic functions, and since systematic and efficient reversible logic synthesis methodologies were significantly missing from previous literature, this dissertation provides several original contributions to reversible logic synthesis by providing a set of tools that can be systematically used to synthesize and evaluate logic functions using reversible logic. This includes, among other new results, Reversible Lattice Structures, Reversible Modified Reconstructability Analysis, Reversible Nets, Reversible Decision Diagrams, and Reversible Cascades. To solve the problem of high signal integrity when processing (computing and transmitting) information using extremely high dense circuits one needs to incorporate the physical quantum mechanical effects that are unavoidable in the nano scales. Since quantum circuits are reversible, and since many of the underlying theorems and formalisms for multiple-valued quantum computing were significantly missing from previous literature, new fundamental foundations for such computations had to be established. These new results include, but not limited to, Quantum Chrestenson Operator, new types of Quantum Decision Trees and Quantum Decision Diagrams as efficient representations for quantum computing, new Composite Basis States, new multiple-valued Einstein-Podolsky-Rosen (EPR) Basis States, and new classes of quantum primitives. Initial evaluations and conclusions for the comparative advantages and disadvantages of the new reversible and quantum computing methodologies are also provided.