An Algorithm for Synthesis of Quantum Reversible Logic Circuits Based on Decomposition

—Until today, we have not found a general and effective algorithm for synthesis, especially to multi-variables quantum circuit. This is an important question needed to be resolved, because it can not only reduce the cost of manufacture quantum circuit, but also optimize many quantum algorithms. For a quantum circuit which contains N quantum bits, the latitude of the matrix is í µí¿ í µí² to realize its function. If we directly design the circuits of the matrix, the workload is huge. Want to reduce the dimensions of the matrix, but also to ensure the unitary of matrix after decomposing, so it is need to use Kronecker product.

[1]  R. Feynman.  Quantum mechanical computers , 1986 .

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

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

[4]  Yahiko Kambayashi,et al.  Transformation rules for designing CNOT-based quantum circuits , 2002, DAC '02.

[5]  D. Gajewski.  Analysis of groups generated by quantum gates , 2009 .

[6]  Guowu Yang,et al.  Algebraic Characterization of Reversible Logic Gates , 2006, Theory of Computing Systems.

[7]  Gerhard W. Dueck,et al.  Toffoli network synthesis with templates , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

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

[10]  John P. Hayes,et al.  Reversible logic circuit synthesis , 2002, IWLS.

[11]  Li Zhi.  A Fast Algorithm for Synthesis of Quantum Reversible Logic Circuits , 2009 .