A METHOD OF MAPPING AND NEAREST NEIGHBOR OPTIMIZATION FOR 2-D QUANTUM CIRCUITS

被引：1

作者：

Zhang, Yuxin ^{[1
]}

Guan, Zhijin ^{[1
]}

Ji, Langyong ^{[1
]}

Luan, Qin Fang ^{[1
]}

Wang, Yizhen ^{[1
]}

机构：

[1] Nantong Univ, Sch Informat Sci & Technol, Nantong 226001, Jiangsu, Peoples R China

来源：

QUANTUM INFORMATION & COMPUTATION | 2020年 / 20卷 / 3-4期

关键词：

Quantum circuit; 2-D grid; Nearest-neighboring; Quantum interaction cost; Interaction path;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In some practical quantum physical architectures, the qubits need to be distributed on 2-dimensional (2-D) grid structure to implement quantum computation. In order to map an 1-dimensional (1-D) quantum circuit into a 2-D grid structure and satisfy the nearest neighbor constraint of qubit interaction in the grid structure, a mapping method from 1-D quantum circuit to 2-D grid structure is proposed in this paper. This method firstly determines the order of placing qubits, and then presents the layout strategy of qubits in 2-D grid. We also proposed an algorithm for establishing interaction paths between non-adjacent qubits in 2-D grid structure, which can satisfy the physical constraints of the interaction of quantum bits in the grid in the process of mapping an 1-D quantum circuit to a 2-D grid structure. For some benchmark circuits, after using the method of this paper to place qubits, it is possible to make every 2-qubit gate in the circuit have a nearest neighbor, so that there is no need to use SWAP gate to establish channel routing. Compared with the latest available methods, the average optimization rate is 82.38%.

引用

页码：194 / 212

页数：19