Corpus ID: 17980325

A Cost Minimization Approach to Synthesis of Linear Reversible Circuits

  title={A Cost Minimization Approach to Synthesis of Linear Reversible Circuits},
  author={Ben Schaeffer and Marek A. Perkowski},
This paper presents a heuristic cost minimization approach to synthesizing linear reversible circuits. Two bidirectional linear reversible circuit synthesis methods are introduced, the Alternating Elimination with Cost Minimization method (AECM) and the Multiple CNOT Gate method (MCG). Algorithms, example syntheses, and extensions to these methods are presented. An MCG variant which incorporates line reordering is introduced. Tests comparing the new cost minimization methods with the best known… Expand
Application of Permutation Group Theory in Reversible Logic Synthesis
Experimental results are presented to show that the proposed synthesis techniques allow a reduction in input lines count, gate complexity or quantum cost of reversible circuits for various benchmark functions. Expand
Synthesis of Reversible Logic Using Enhanced Genetic Programming Approach
A new enhanced reversible logic circuit synthesis method was developed using reversible gates that include NOT, CNOT (Feynman), Toffoli, Fredkin, Swap, and Peres gates. The synthesis method was doneExpand
Gaussian Elimination versus Greedy Methods for the Synthesis of Linear Reversible Circuits
Linear reversible circuits represent a subclass of reversible circuits with many applications in quantum computing. These circuits can be efficiently simulated by classical computers and their sizeExpand
New universal gate library for synthesizing reversible logic circuit using genetic programming
A newly formed universal gate library, that includes NOT, CNOT (Feyman), Toffoli, Fredkin, Swap, Peres gates and a special gate called G gate and the results were promising because the gate complexity in the circuits were drastically reduced compared to previously attempted synthesis. Expand
Synthesis of Linear Reversible Circuits and EXOR-AND-based Circuits for Incompletely Specified Multi-Output Functions
This book presents a meta-analyses of the determinants of infectious disease in eight operation rooms and some of the mechanisms leading to disease initiation and its consequences are described. Expand


Optimal synthesis of linear reversible circuits
Simulation results show that even for relatively small n the authors' algorithm is faster and yields smaller circuits than the standard method, and can be interpreted as a matrix decomposition algorithm, yielding an asymptotically efficient decomposition of a binary matrix into a product of elementary matrices. Expand
Reversible Computing - Fundamentals, Quantum Computing, and Applications
This book describes reversible computing from various points of view: Boolean algebra, group theory, logic circuits, low-power electronics, communication, software, quantum computing, multidisciplinary approach. Expand
Computer Aided Design of Permutation, Linear, and Affine-Linear Reversible Circuits in the General and Linear Nearest-Neighbor Models
This book aims to provide a chronology of the events leading up to and including the publication of this work and its publication in the peer-reviewed literature. Expand
Algebraic Cryptonalisis
  • Springer Verlag.
  • 2009
Computer Aided Design of Permutation, Linear, and Affine-Linear Revers ­ ible Circuits in the General and Linear Nearest-Neighbor Models. Dissertations and Theses. Paper 986
  • Bard, G. V.: Algebraic Cryptonalisis
  • 2009
On Economical Construc­ tion of the Transitive Closure of an Oriented Graph
  • Soviet Mathematics Doklady, 12091210
  • 1970