[1] Shor P W. The difficulty of factoring large numbers is one of the cornerstones of some important cryptographic schemes [C] //in Proceedings of the 35th Annual Symposium on FOCS, edited by S.Goldwasser, IEEE Comput.Sci. Press, Los Alamos, 1994, 124.

[2] Chuang I L, et al. Experimental realization of a quantum algorithm [J]. Nature, 1998, 393: 143.

[3] Jones J A, et al. Geometric quantum computation using nuclear magnetic resonance [J]. Nature, 2000, 403: 869.

[4] Du Jiangfeng, et al. Implementation of quantum logic gates by nuclear magnetic resonance spectroscopy [J].Chin. Phys. Lett., 2000, 17: 64.

[5] Du Jiangfeng, et al. Realization of the three-qubit Toffoli gate in molecules [J]. Chin. Phys. Lett., 2000, 17: 859.

[6] Du Jiangfeng, et al. Implementing universal multiqubit quantum logic gates in three- and four-spin systems at a room temperature [J]. Phys. Rev. A, 2001, 63: 042302.

[7] Wei D X, et al. Experimental realization of 7-qubit universal perfect controlled-NOT and controlled square-root NOT gates [J]. quant-ph/0109002 (2001).

[8] Fredkin E, Toffoli T. Conservative logic [J]. Inter. J. Theor. Phys., 1982, 21: 219.

[9] Toffoli T. Bicontinuous extensions of invertible combinational functions [J]. Math. Systems Theory, 1982, 14: 13.

[10] Deutsch D. Quantum computational networks [J]. Proc. R. Soc. London Setr. A, 1989, 425: 73.

[12] Barenco A, et al. Conditional quantum dynamics and logic gates [J]. Phys. Rev. Lett., 1995, 74: 4083.

[14] Pan Jianwei, et al. Entanglement purification for quantum communication [J]. Nature, 2001, 410: 1067.

[15] Duan Luming, et al. Entanglement purification of Gaussian continuous variable quantum states [J]. Phys. Rev.Lett., 2000, 84: 4002.