A Single Universal n-bit Gate for Reversible Circuit Synthesis

Many universal reversible libraries that contain more than one gate type have been proposed in the literature. Practical implementation of reversible circuits is much easier if a single gate type is used in the circuit construction. This paper proposes a reversible n-bit gate that is universal for reversible circuits synthesis. The proposed gate is extendable according to the size of the circuit. The paper shows that the size of the synthesized circuits using the proposed gate is comparable with the size of the synthesized circuits using the hybrid reversible libraries for 3-in/out reversible circuits.

[1]  John P. Hayes,et al.  Data structures and algorithms for simplifying reversible circuits , 2006, JETC.

[2]  Gerhard W. Dueck,et al.  Spectral Techniques for Reversible Logic Synthesis , 2002 .

[3]  Gerhard W. Dueck,et al.  Fredkin/Toffoli Templates for Reversible Logic Synthesis , 2003, ICCAD 2003.

[4]  Gerhard W. Dueck,et al.  A transformation based algorithm for reversible logic synthesis , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[5]  Todd A. Brun,et al.  Quantum Computing , 2011, Computer Science, The Hardware, Software and Heart of It.

[6]  Tommaso Toffoli,et al.  Reversible Computing , 1980, ICALP.

[7]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[8]  M. I. Kargapolov,et al.  Fundamentals of the theory of groups , 1979 .

[9]  Gerhard W. Dueck,et al.  Reversible Function Synthesis with Minimum Garbage Outputs , 1997 .

[10]  John P. Hayes,et al.  Synthesis of reversible logic circuits , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  T. Toffoli,et al.  Conservative logic , 2002, Collision-Based Computing.

[12]  Yahiko Kambayashi,et al.  Transformation rules for designing CNOT-based quantum circuits , 2002, DAC '02.

[13]  Alexis De Vos,et al.  Symmetry Groups for the Decomposition of Reversible Computers, Quantum Computers, and Computers in between , 2011, Symmetry.

[14]  Xiaoyu Song,et al.  Synthesis of reversible circuits with minimal costs , 2008 .

[15]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[16]  Gerhard W. Dueck,et al.  Quantum circuit simplification using templates , 2005, Design, Automation and Test in Europe.

[17]  A. Adamski,et al.  Design of Reversible Logic Circuits by Means of Control Gates , 2000, PATMOS.

[18]  Leo Storme,et al.  Group Theoretical Aspects of Reversible Logic Gates , 1999, J. Univers. Comput. Sci..

[19]  Alexis De Vos,et al.  Control gates as building blocks for reversible computers , 2001 .

[20]  Birger Raa,et al.  INSTITUTE OF PHYSICS PUBLISHING JOURNAL OF PHYSICS A: MATHEMATICAL AND GENERAL J. Phys. A: Math. Gen. 35 (2002) 7063–7078 PII: S0305-4470(02)34943-6 Generating the group of reversible logic gates , 2022 .

[21]  J. Dixon,et al.  Permutation Groups , 1996 .

[22]  Rudy Lauwereins,et al.  Design, Automation, and Test in Europe , 2008 .

[23]  Dmitri Maslov,et al.  Synthesis of the optimal 4-bit reversible circuits , 2010, Design Automation Conference.

[24]  Gerhard W. Dueck,et al.  Simplification of Toffoli networks via templates , 2003, 16th Symposium on Integrated Circuits and Systems Design, 2003. SBCCI 2003. Proceedings..

[25]  Alexis De Vos,et al.  From Group Theory to Reversible Computers , 2008, Int. J. Unconv. Comput..