Improved quantum cost for n-bit Toffoli gates

An n-bit Toffoli gate quantum circuit based on the realisation proposed by Barenco et al., where some of the Toffoli gates in their construction are replaced with Peres gates, is presented. This results in a significant cost reduction. The main contribution of this presentation is a quantum circuit which simulates the (m+1)-bit Toffoli gate with 32m−120 elementary quantum gates and one garbage bit which is passed unchanged.

[1]  D.M. Miller,et al.  Fredkin/Toffoli templates for reversible logic synthesis , 2003, ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486).

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

[3]  Gerhard W. Dueck,et al.  Templates for Toffoli Network Synthesis , 2003 .

[4]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

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

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