[1] Shor P W. Algorithms for quantum computation: Discrete logarithms and factoring[C], 124-134(1994).

[2] Grover L K. A fast quantum mechanical algorithm for database search[C], 212-219(1996).

[3] Córcoles A D, Magesan E, Srinivasan S J et al. Demonstration of a quantum error detection code using a square lattice of four superconducting qubits[J]. Nature Communications, 6, 6979(2015).

[4] Taylor J M, Petta J R, Johnson A C et al. Relaxation, dephasing, and quantum control of electron spins in double quantum dots[J]. Physical Review B, 76, 035315(2007).

[6] Shen M Y, Cheng X Y, Guan Z J et al. Realization method of two-dimensional nearest neighbor for quantum circuit[J]. Chinese Journal of Quantum Electronics, 36, 476-482(2019).

[7] Hattori W, Yamashita S. Mapping a quantum circuit to 2D nearest neighbor architecture by changing the gate order[J]. IEICE Transactions on Information and Systems, E102.D, 2127-2134(2019).

[8] Zulehner A, Paler A, Wille R. An efficient methodology for mapping quantum circuits to the IBM QX architectures[J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 38, 1226-1236(2019).

[9] Zhang Y X, Guan Z J, Ji L Y et al. A method of mapping and nearest neighbor optimization for 2D quantum circuits[J]. Quantum Information and Computation, 20, 194-212(2020).

[10] Farghadan A, Mohammadzadeh N. Quantum circuit physical design flow for 2D nearest-neighbor architectures[J]. International Journal of Circuit Theory and Applications, 45, 989-1000(2017).

[11] Shafaei A, Saeedi M, Pedram M. Qubit placement to minimize communication overhead in 2D quantum architectures[C], 495-500(2014).

[12] Lin C C, Sur-Kolay S, Jha N K. PAQCS: Physical design-aware fault-tolerant quantum circuit synthesis[J]. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 23, 1221-1234(2015).

[13] Cheng X Y, Tan Y Y, Guan Z J et al. An optimized simplification algorithm for reversible MCT circuits[J]. Chinese Journal of Quantum Electronics, 34, 713-720(2017).