[1] Golubitsky O, Maslov D. A study of optimal 4-bit reversible Toffoli circuits and their synthesis[J]. IEEE Transactions on Computers, 2012, 61(9): 1341-1353.

[2] Krishna M, Chattopadhyay A. Efficient reversible logic synthesis via isomorphic subgraph matching[C]. th International Symposium on Multiple-Valued Logic (ISMVL), 2014: 103-108.

[3] Soeken M, Chattopadhyay A. Fredkin-enabled transformation-based reversible logic synthesis[C]. IEEE International Symposium on Multiple-Valued Logic (ISMVL), 2015: 60-65.

[4] Soeken M, Tague L, Dueck G W, et al. Ancilla-free synthesis of large reversible functions using binary decision diagrams[J]. Journal of Symbolic Computation, 2016, 73: 1-26.

[5] Fan F, Yang G, Yang G, et al. A synthesis method of quantum reversible logic circuit based on elementary qutrit quantum logic gates[J]. Journal of Circuits, Systems and Computers, 2015, 24(8): 1550121.

[6] Li Z Q, Chen H W, Liu W J, et al. Efficient algorithm for synthesis of optimal NCV 3-qubit reversible circuits using new quantum logic gate library[J]. Acta Electronica Sinica, 2013, 41(4): 690-697.

[7] Maslov D, Miller D M. Comparison of the cost metrics through investigation of the relation between optimal NCV and optimal NCT three-qubit reversible circuits[J]. IET Computers and Digital Techniques, 2007, 1(2): 98-104.

[8] Yang G, Song X, Perkowski M A, et al. Four-level realisation of 3-qubit reversible functions[J]. IET Computers and Digital Techniques, 2007, 1(4): 382-388.

[9] Knill E, Laflamme R, Milburn G J. A scheme for efficient quantum computation with linear optics[J]. Nature, 2001, 409(6816): 46-52.

[10] Laforest M, Simon D, Boileau J C, et al. Using error correction to determine the noise model[J]. Phys. Rev. A, 2007, 75(1): 012331.

[11] Benjamin S C. Topological quantum computing with a very noisy network and local error rates approaching one percent[J]. Nature Communications, 2012, 4(4): 1756.

[12] Perkowski M, Lukac M, Shah D, et al. Synthesis of quantum circuits in linear nearest neighbor model using positive Davio lattices[J]. Facta Universitatis-Series: Electronics and Energetics, 2011, 24(1): 73-89.

[13] Saeedi M, Wille R, Drechsler R. Synthesis of quantum circuits for linear nearest neighbor architectures[J]. Quantum Information Processing, 2011, 10(3): 355-377.

[14] AlFailakawi M, AlTerkawi L, Ahmad I, et al. Line ordering of reversible circuits for linear nearest neighbor realization[J]. Quantum Information Processing, 2013, 12(10): 3319-3339.

[15] Hirata Y, Nakanishi M, Yamashita S, et al. An efficient conversion of quantum circuits to a linear nearest neighbor architecture[J]. Quantum Information and Computation, 2011, 11(1): 142-166.

[16] Matsuo A, Yamashita S. Changing the gate order for optimal LNN conversion[C]. Proceedings of the Third International Conference on Reversible Computation, 2012, 7165: 89-101.

[17] Shafaei A, Saeedi M, Pedram M. Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures[C]. Proceedings of the 50th Annual Design Automation Conference, ACM, 2013: 41.

[18] Wille R, Lye A, Drechsler R. Exact reordering of circuit lines for nearest neighbor quantum architectures[J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2014, 33(12): 1818-1831.

[19] Lye A, Wille R, Drechsler R. Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits[C]. The 20th Asia and South Pacific Design Automation Conference, ASP-DAC, 2015: 178-183.

[20] Lee S, Lee S J, Kim T, et al. The cost of quantum gate primitives[J]. Journal of Multiple-Valued Logic and Soft Computing, 2006, 12(5): 561-573.