Reversible logic circuit synthesis
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
A transformation based algorithm for reversible logic synthesis
Proceedings of the 40th annual Design Automation Conference
A new heuristic algorithm for reversible logic synthesis
Proceedings of the 41st annual Design Automation Conference
Analysis and synthesis of quantum circuits by using quantum decision diagrams
Proceedings of the conference on Design, automation and test in Europe: Proceedings
A novel synthesis algorithm for reversible circuits
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Logical reversibility of computation
IBM Journal of Research and Development
Synthesis of reversible logic circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Toffoli network synthesis with templates
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 0.00 |
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.