Synthesis of Reversible Circuits Using Heuristic Search Method

Reversible circuits are of vital importance in many applications involving low power design. One of the principle areas where reversible circuits play great role is quantum computing. One of the foremost requirements of quantum computation is that it requires all the circuits that are used should be reversible in nature. Reversible circuit is one which maps an individual input vector to a singular output vector. Because of its application in many areas including quantum computing, many synthesis approaches have been developed. In this paper we focus on a synthesis approach which is based on permutation theory and heuristic search. An artificial intelligence based search technique A* is used to find near optimal solutions. Experimental results demonstrate that the proposed approach provides solutions within a very reasonable span of time.

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

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

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

[4]  Alexis De Vos,et al.  A reversible carry-look-ahead adder using control gates , 2002, Integr..

[5]  Hafizur Rahaman,et al.  Optimal Reversible Logic Circuit Synthesis Based on a Hybrid DFS-BFS Technique , 2010, 2010 International Symposium on Electronic System Design.

[6]  Thomas F. Knight,et al.  Asymptotically Zero Energy Split-Level Charge Recovery Logic , 1994 .

[7]  Ruby B. Lee,et al.  Architectural enhancements for fast subword permutations with repetitions in cryptographic applications , 2001, Proceedings 2001 IEEE International Conference on Computer Design: VLSI in Computers and Processors. ICCD 2001.

[8]  Rolf Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

[9]  Niraj K. Jha,et al.  An Algorithm for Synthesis of Reversible Logic Circuits , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[10]  Morteza Saheb Zamani,et al.  Moving forward: A non-search based synthesis method toward efficient CNOT-based quantum circuit synthesis algorithms , 2008, 2008 Asia and South Pacific Design Automation Conference.

[11]  Robert Wille,et al.  Improving ESOP-Based Synthesis of Reversible Logic Using Evolutionary Algorithms , 2011, EvoApplications.

[12]  Robert Wille,et al.  BDD-based synthesis of reversible logic for large functions , 2009, 2009 46th ACM/IEEE Design Automation Conference.

[13]  Richard Phillips Feynman,et al.  Quantum mechanical computers , 1984, Feynman Lectures on Computation.

[14]  G.E. Moore,et al.  Cramming More Components Onto Integrated Circuits , 1998, Proceedings of the IEEE.

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

[16]  John P. Hayes,et al.  Reversible logic circuit synthesis , 2002, IWLS.

[17]  Michael S. Hsiao,et al.  Reversible logic synthesis through ant colony optimization , 2010, 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010).

[18]  Rolf Drechsler,et al.  Exact sat-based toffoli network synthesis , 2007, GLSVLSI '07.

[19]  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 .

[20]  R. Feynman Quantum mechanical computers , 1986 .

[21]  Gerhard W. Dueck,et al.  Techniques for the synthesis of reversible Toffoli networks , 2006, TODE.