[1] Nielsen M, Chuang I. Quantum Computation and Quantum Information [M]. Cambridge: Cambridge University Press, 2000.
[2] Monroe C, Kim J. Scaling the ion tap quantum processor [J]. Science , 2013, 339(6124): 1164-1169.
[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 , 2015, 6: 6979.
[5] Shafaei A, Saeedi M, Pedram M. Qubit placement to minimize communication overhead in 2D quantum architectures [C]. Design Automation Conference IEEE , 2014: 495-500.
[6] Lye A, Wille R, Drechsler R. Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits [C]. Design Automation Conference IEEE , 2015: 178-183.
[7] Kole A, Datta K, Sengupta I. A new heuristic for N-dimensional nearest neighbor realization of a quantum circuit [J]. IEEE Transactions on Computer-Aided Design of Integrated Circuit and Systems , 2017, 99: 1.
[8] Shrivastwa R R, Datta K, Sengupta I. Fast qubit placement in 2D architecture using nearest neighbor realization [C]. IEEE International Symposium on Nanoelectronic and Information Systems , 2015: 95-100.
[9] Wille R, Keszocze O, Walter M, et al . Look-ahead schemes for nearest optimization of 1D and 2D quantum circuits [C]. Asia and South Pacific Design Automation Conference IEEE , 2016: 292-297.
[10] Alfailakwi M G, Ahmdan S. Harmony-search algorithm for 2D nearest neighbor quantum circuits realization [J]. Expert Systems with Applications , 2016, 61: 16-27.
[11] 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.
[12] Geem Z W, Kim J H, Loganathan G. A new heuristic optimization algorithm: Harmony search [J]. Simulation , 2001, 7(2): 60-68.
[14] Tan Y Y, Cheng X Y, Guan Z J, et al . Multi-strategy based quantum cost reduction of linear nearest-neighbor quantum circuit [J]. Quantum Information Processing , 2018, 17(3): 61.