Lowering the Quantum Gate Cost of Reversible Circuits

One approach to determining a quantum circuit is to first synthesize a circuit composed of binary reversible gates and to then map that circuit to an equivalent quantum gate realization. This paper considers the mapping phase with the goal of reducing the number of quantum gates required. Our method is based on novel line labeling and gate moving procedures. Results are presented for the quantum library: NOT, controlled-NOT, and the square-root-of-NOT gates (V and V+). The approach is applicable to other quantum gate libraries.

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

[2]  Pérès,et al.  Reversible logic and quantum computers. , 1985, Physical review. A, General physics.

[3]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[4]  Gerhard W. Dueck,et al.  Reversible Logic Synthesis , 2020, Reversible and DNA Computing.

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

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

[7]  Robert Wille,et al.  RevLib: An Online Resource for Reversible Functions and Reversible Circuits , 2008, 38th International Symposium on Multiple Valued Logic (ismvl 2008).

[8]  Tsutomu Sasao,et al.  Progress in Applications of Boolean Functions , 2010, Progress in Applications of Boolean Functions.

[9]  D. Michael Miller,et al.  Lower cost quantum gate realizations of multiple-control Toffoli gates , 2009, 2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing.

[10]  Robert Wille,et al.  Reducing Reversible Circuit Cost by Adding Lines , 2010, 2010 40th IEEE International Symposium on Multiple-Valued Logic.