[1] Deutsch D. Quantum theory, the Church-Turing principle and the universal quantum computer ［J］. Proc. of Roy. Soc. Lon. A, 1985, 400: 97-117.

[2] Shor P W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer ［J］. SIAM Journal on Computing, 1997, 26: 1484-1509.

[3] Miller M D, Maslov D, Dueck G W. A transformation based algorithm for reversible logic synthesis ［C］. DAC, 2003, 318-321.

[7] Maslov D, Dueck G W, Miller D M. Toffoli network synthesis with templates ［J］. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, 2005, 24(6): 807-817.

[8] Miller D M, Maslov D, Gueck G W. Spectral and two-place decomposition techniques in reversible logic ［C］. Proceedings of the 45th IEEE International Midwest Symposium on Circuits and Systems, Tulsa, 2002, 493-496.

[9] Gupta P, Agrawal A, Jha N K. An algorithm for synthesis of reversible logic circuits ［J］. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, 2006, 25(11): 807-817.

[11] Li Z Q, Chen H W, Xu B W. Fast algorithms for 4-qubit reversible logic circuits synthesis ［J］. Acta Electronic Sinica, 2008, 36(11): 2081-2089.