A Novel RM-Based Algorithm for Reversible Circuits

This paper presents a heuristic fast-matching algorithm for quantum reversible logic circuits synthesis. The algorithm uses the quantum gate formula as the heuristic rules to perform forward-matching. This can avoid blind matching and decrease the matching complexity. Simple, smaller overhead and better to simplify circuits, the algorithm can perform well in the multi-quantum reversible logic circuits synthesis.

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

[2]  Xue Xi-ling Fast Algorithms for 4-qubit Reversible Logic Circuits Synthesis , 2008 .

[3]  Gerhard W. Dueck,et al.  Toffoli network synthesis with templates , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[5]  Guowu Yang,et al.  Four-level realisation of 3-qubit reversible functions , 2007, IET Comput. Digit. Tech..

[6]  Massoud Pedram,et al.  Analysis and Synthesis of Quantum Circuits by Using Quantum Decision Diagrams , 2006, Proceedings of the Design Automation & Test in Europe Conference.

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

[8]  Pawel Kerntopf,et al.  A new heuristic algorithm for reversible logic synthesis , 2004, Proceedings. 41st Design Automation Conference, 2004..

[9]  Morteza Saheb Zamani,et al.  A novel synthesis algorithm for reversible circuits , 2007, ICCAD 2007.

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