[1] Feynman R. Quantum mechanical computers ［J］. Optic News, 1986, 1 (6): 11-20.

[2] Fredkin E, Toffoli T. Conservative logic ［J］. International Journal of Theoretical Physics, 1982, 21(3): 219-253.

[3] Vedral V, Barenco A, Ekert A. Quantum networks for elementary arithmetic operations ［J］. Phys. Rev. A, 1996, 54(1): 147-153.

[4] Maslov D, Dueck G W, et al. Toffoli network synthesis with templates ［J］. IEEE Transactions on CAD, 2005, 24(6): 807-817.

[5] Gupta P, Agrawa A, Jha N K. An algorithm for synthesis of reversible logic circuits ［J］. IEEE Transactions on CAD, 2006, 25(11): 807-817.

[7] Shende V V, Prasad A K, et al. Synthesis of reversible logic circuits ［J］. IEEE Transactions on CAD, 2003, 22(6): 723-729.

[8] Yang G W, Song X, et al. Fast synthesis of exact minimal reversible circuits using group theory ［C］. Proceedings of the 10th Asia and South Pacific Design Automation Conference, Shanghai, 2005, 2: 18-21.

[9] Li Z Q, Chen H W, Xu B W, et al. Fast algorithm for 4-qubit reversible logic circuits synthesis ［C］. Proceedings of WCCI 2008, Hong Kong, 2008, 300-306.

[12] Thapliyal H, Bhatt A, Ranganathan N. A new CRL gate as super class of Fredkin gate to design reversible quantum circuits ［C］. Proceedings of the 56th IEEE International Midwest Symposium on Circuits and Systems, Columbus, 2013, 8: 1067-1070.

[13] Li Z, Chen H, Yang G, et al. Efficient algorithms for optimal 4-bit reversible logic system synthesis ［J］. Journal of Applied Mathematics, 2013, doi.org/10.1155/2013/291410.