Transformation rules for designing CNOT-based quantum circuits

This paper gives a simple but nontrivial set of local transformation rules for Control-NOT(CNOT)-based combinatorial circuits. It is shown that this rule set is complete, namely, for any two equivalent circuits, S1 and S2, there is a sequence of transformations, each of them in the rule set, which changes S1 to S2. Our motivation is to use this rule set for developing a design theory for quantum circuits whose Boolean logic parts should be implemented by CNOT based circuits. As a preliminary example, we give a design procedure based on our transformation rules which reduces the cost of CNOT-based circuits.

[1]  Yongwook Chung,et al.  A Practical Method of Constructing Quantum Combinational Logic Circuits , 1999 .

[2]  Fabio Somenzi,et al.  Logic synthesis and verification algorithms , 1996 .

[3]  Robert K. Brayton,et al.  MIS: A Multiple-Level Logic Optimization System , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Tommaso Toffoli,et al.  Reversible Computing , 1980, ICALP.

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

[6]  Andrew Chi-Chih Yao,et al.  Quantum Circuit Complexity , 1993, FOCS.

[7]  Robert K. Brayton,et al.  Multiple-Level Logic Optimization System , 2003 .

[8]  Kazuo Iwama,et al.  Random benchmark circuits with controlled attributes , 1997, Proceedings European Design and Test Conference. ED & TC 97.

[9]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[10]  Louise Trevillyan,et al.  Logic Synthesis Through Local Transformations , 1981, IBM J. Res. Dev..

[11]  Jozef Gruska,et al.  Quantum Computing , 2008, Wiley Encyclopedia of Computer Science and Engineering.

[12]  Jean-Pierre Deschamps,et al.  Discrete and switching functions , 1978 .