Processing

Please wait...

Settings

Settings

Goto Application

1. CN112381231 - Quantum topological graph optimization method and device, terminal and storage medium

Office
China
Application Number 202011196669.4
Application Date 31.10.2020
Publication Number 112381231
Publication Date 19.02.2021
Publication Kind A
IPC
G06N 10/00
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
NCOMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
10Quantum computers, i.e. computer systems based on quantum-mechanical phenomena
CPC
G06N 10/00
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
NCOMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
10Quantum computers, i.e. computer systems based on quantum-mechanical phenomena
Applicants ORIGIN QUANTUM COMPUTING TECHNOLOGY CO., LTD.
合肥本源量子计算科技有限责任公司
Inventors KONG WEICHENG
孔伟成
Title
(EN) Quantum topological graph optimization method and device, terminal and storage medium
(ZH) 一种量子拓扑图优化方法、装置、终端及存储介质
Abstract
(EN) The invention discloses a quantum topological graph optimization method and device, a terminal and a storage medium, and the method comprises the steps of obtaining a first quantum topological graph of a target quantum algorithm, and judging whether there is a cross connection line and/or a to-be-optimized node in the first quantum topological graph or not; determining an intermediate node in thefirst quantum topological graph, reserving connecting lines between the intermediate node and other graph nodes, obtaining connecting line weights of the connecting lines between the other graph nodes, and deleting the connecting lines according to the connecting line weights to obtain a second quantum topological graph which does not contain cross connecting lines; and determining an optimizationsub-graph composed of N sub-nodes which correspond to the to-be-optimized node and are communicated through connecting lines according to a preset mode, and allocating the connecting lines between the non-optimized node and the sub-nodes to obtain an optimized quantum topological graph. According to the invention, the depth of the quantum algorithm is simplified, the fidelity of the quantum algorithm is improved, and the complex quantum algorithm runs on the quantum chip.
(ZH) 本申请公开了一种量子拓扑图优化方法、装置、终端及存储介质,包括获取目标量子算法的第一量子拓扑图,判断所述第一量子拓扑图中是否存在交叉连线和/或待优化节点;确定所述第一量子拓扑图中的中介节点,保留所述中介节点与其它图谱节点之间的连线,获取各其它图谱节点之间连线的连线权重,并根据连线权重进行连线删除,以获得不包含交叉连线的第二量子拓扑图;根据预设方式确定一个所述待优化节点对应的通过连线连通的N个子节点组成的优化子图,对非优化节点与各所述子节点之间的连线进行分配,获得优化量子拓扑图。本申请简化量子算法深度,提高量子算法保真度,使得复杂的量子算法在量子芯片上运行。
Related patent documents