A Realization Method of Two-Dimensional Nearest Neighbor for Quantum Circuit

Chinese Journal of Quantum Electronics ›› 2019, Vol. 36 ›› Issue (4): 476-482.

• Quantum Optics • Previous Articles Next Articles

A Realization Method of Two-Dimensional Nearest Neighbor for Quantum Circuit

SHEN Mingyan1, CHENG Xueyun1,2, GUAN Zhijin1*, CHEN Jiaqing1, HE Xianya1

1 College of Computer Science and Technology, Nantong University, Nantong 226019, China; 2 College of Electronics and Information, Nantong University, Nantong 226019, China

Received:2019-01-03 Revised:2019-03-08 Published:2019-07-28 Online:2019-07-11

Abstract

Abstract: In order to solve the problem of qubit nearest neighbor constraint in some quantum techniques, In this paper, a priority-based nearest neighbor interaction cost measurement model is proposed, and the optimal layout of the qubit in two-dimensional architecture is obtained based on the harmony search (HS) algorithm, and then the insertion of the SWAP gate is performed by the given local sorting method. Finally, the quantum circuit realizes the nearest neighbor interaction under the two-dimensional architecture. The algorithm is verified by experiments and compared with the latest results. The experimental results show that the average decrease of SWAP gates in the proposed method is 14.42% compared with that in the two-dimensional grid architecture reported in the literature.

Key words: quantum computation, quantum circuit synthesis, nearest neighbor arrangement, two-dimensional architecture, harmonious search algorithm

CLC Number:

TP302.2

SHEN Mingyan1, CHENG Xueyun1,2, GUAN Zhijin1*, CHEN Jiaqing1, HE Xianya1. A Realization Method of Two-Dimensional Nearest Neighbor for Quantum Circuit[J]. Chinese Journal of Quantum Electronics, 2019, 36(4): 476-482.

References

[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. [4] Cheng Xueyun, Guan Zhijin. Linear nearest neighbor quantum circuit synthesis based on valid Boolean matrix[J]. Chinese Journal of Quantum Electroincs（量子电子学报）, 2016, 33(6): 743-750(in Chinese). [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, 76(2): 60-68. [13] Cheng Xueyun, Tan Yingying, Guan Zhijin. An optimized simplification algorithm for reversible MCT circuits[J]. Chinese Journal of Quantum Electroincs（量子电子学报）, 2017, 34(6): 713-720(in Chinese). [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.

A Realization Method of Two-Dimensional Nearest Neighbor for Quantum Circuit

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 6

Recommended Articles

Metrics

Comments

[1]	ZHU Mingqiang , SHEN Wenjie , NIU Yiren , ZHANG Chao , CHENG Xueyun , GUAN Zhijin , CHEN Liang. Reliability⁃oriented nearest neighbor synthesis of CNOT quantum circuits [J]. Chinese Journal of Quantum Electronics, 2023, 40(4): 560-569.
[2]	. An image saliency detection scheme based on quantum mechanism [J]. J4, 2017, 34(3): 305-315.
[3]	Chen Yue-Yue, Liu Chengpu, Feng Xun-Li. Quantum computation in decoherence-free subspaces for overcoming bit-flip erroe in cavity QED [J]. J4, 2016, 33(5): 553-560.
[4]	WANG Le, LIU Ying, WANG Yan-yan, ZHAO Sheng-mei. Fault-tolerant extended rectangle construction of quantum CNOT gate using（49,1,9）quantum code with the overlap method [J]. J4, 2014, 31(2): 179-185.
[5]	Li Sheng, Zhang Peilin, Li Bing, Zhou Yunchuan. Quantum GA-PLS for Feature Selection Method and its Application [J]. J4, 2014, 31(2): 194-201.
[6]	ZHANG Gang, DONG Ping. Unconventional geometric quantum computation with quantum-dot spin qubits inside a cavity [J]. J4, 2009, 26(4): 431-436.