[1] Shor P W. Algorithms for quantum computation: Discrete logarithms and factoring［C］. Proceedings of 35th Annual Symposium on Foundations of Computer Science, 1994: 124-134.
[2] Grover L K. A fast quantum mechanical algorithm for database search［C］. Twenty-Eighth ACM Symposium on Theory of Computing, 1996: 212-219.
[3] GroBe D, Wille R, Dueck G W, et al. Exact synthesis of elementary quantum gate circuits［J］. Journal of Multiple-Valued Logic and Soft Computing, 2009: 283-300.
[5] Soeken M, Wille R, Hilken C, et al. Synthesis of reversible circuits with minimal lines for large functions［C］. Design Automation Conference, 2012: 85-92.
[6] Miller D M, Wille R, Sasanian Z. Elementary quantum gate realizations for multiple-control Toffoli gates［C］. IEEE International Symposium on Multiple-Valued Logic, 2011: 288-293.
[7] Nickerson N H, Li Y, 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.
[8] Saeedi M, Wille R, Drechsler R. Synthesis of quantum circuits for linear nearest neighbor architectures［J］. Quantum Information Processing, 2012, 10(3): 355-377.
[9] Hirata Y, Nakanishi M, Yamashita S, et al. An efficient method to convert arbitrary quantum circuits to ones on a linear nearest neighbor architecture［C］. Third International Conference on Quantum, Nano and MICRO Technologies, 2009: 26-33.
[10] 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.
[11] Kole A, Datta K, Sengupta I. A heuristic for linear nearest neighbor realization of quantum circuits by SWAP gate insertion using N-gate lookahead［J］. IEEE Journal on Emerging and Selected Topics in Circuits and Systems, 2016, (1): 62-72.
[12] Saeedi M, Wille R, Drechsler R. Synthesis of quantum circuits for linear nearest neighbor architectures［J］. Quantum Information Processing, 2012, 10(3): 355-377.
