Transformation rules for designing CNOT-based quantum circuits
Proceedings of the 39th annual Design Automation Conference
Quantum computation and quantum information
Quantum computation and quantum information
A transformation based algorithm for reversible logic synthesis
Proceedings of the 40th annual Design Automation Conference
Simplification of Toffoli Networks via Templates
SBCCI '03 Proceedings of the 16th symposium on Integrated circuits and systems design
A new heuristic algorithm for reversible logic synthesis
Proceedings of the 41st annual Design Automation Conference
Quantum logic synthesis by symbolic reachability analysis
Proceedings of the 41st annual Design Automation Conference
Multilinear formulas and skepticism of quantum computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Fredkin/Toffoli Templates for Reversible Logic Synthesis
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Techniques for the synthesis of reversible Toffoli networks
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A novel synthesis algorithm for reversible circuits
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
Exact multiple-control toffoli network synthesis with SAT techniques
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Reversible circuit synthesis using a cycle-based approach
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Fault Models for Quantum Mechanical Switching Networks
Journal of Electronic Testing: Theory and Applications
Rule-based optimization of reversible circuits
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
Optimization of reversible circuits using reconfigured templates
RC'11 Proceedings of the Third international conference on Reversible Computation
RMDDS: Reed-muller decision diagram synthesis of reversible logic circuits
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Considering nearest neighbor constraints of quantum circuits at the reversible circuit level
Quantum Information Processing
Hi-index | 0.01 |
Optimal synthesis of quantum circuits is intractable and heuristic methods must be employed. Templates are a general approach to reversible and quantum circuit simplification. In this paper, we consider the use of templates to simplify a quantum circuit initially found by other means. We present and analyze templates in the general case, and then provide particular details for circuits composed of NOT, CNOT and controlled-sqrt-of-NOT gates. We introduce templates for this set of gates and apply them to simplify both known quantum realizations of Toffoli gates and circuits found by earlier heuristic Fredkin and Toffoli gate synthesis algorithms. While the number of templates is quite small, the reduction in quantum cost is often significant.