Optimal and asymptotically optimal NCT reversible circuits by the gate types

We report optimal and asymptotically optimal reversible circuits composed of NOT, CNOT, and Toffoli (NCT) gates, keeping the count by the subsets of the gate types used. This study fine tunes the circuit complexity figures for the realization of reversible functions via reversible NCT circuits. An important consequence is a result on the limitation of the use of the $T$-count quantum circuit metric popular in applications.

[1]  Igor L. Markov,et al.  On the CNOT-cost of TOFFOLI gates , 2008, Quantum Inf. Comput..

[2]  Cody Jones,et al.  Low-overhead constructions for the fault-tolerant Toffoli gate , 2012, 1212.5069.

[3]  A. Kitaev,et al.  Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages) , 2004, quant-ph/0403025.

[4]  Morteza Saheb Zamani,et al.  Reversible circuit synthesis using a cycle-based approach , 2010, JETC.

[5]  N. S. Barnett,et al.  Private communication , 1969 .

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

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

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

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

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

[11]  Elham Kashefi,et al.  Comparison of quantum oracles , 2002 .

[12]  M. Mosca,et al.  A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits , 2012, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  Dmitry V. Zakablukov.  On asymptotic gate complexity and depth of reversible circuits without additional memory , 2017, J. Comput. Syst. Sci..

[14]  Andrew F. Rex,et al.  Maxwell's Demon, Entropy, Information, Computing , 1990 .

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