Patent ID: 11934919
Assignee: ORIGIN QUANTUM COMPUTING TECHNOLOGY (HEFEI) CO., LTD.
Field: Computer technology (Electrical engineering)
Classification: CPC G | IPC G

Claim 2:
3. The quantum topology graph optimization method of claim 1, wherein the connecting lines in the first quantum topology graph has a coarseness that represents a number of qubit logic gates applied between any two logic bits in the quantum algorithm, and the step of determining an intermediate node in the first quantum topology graph when there are crossed connecting lines in the first quantum topology graph, comprises:
obtaining connectivity, weight and/or dispersion of all graph nodes in the first quantum topology graph, wherein the connectivity is a quantity of connecting lines connected by each graph node, the weight is a sum of the coarseness of all connecting lines connected by each graph node, and the dispersion is a variance of the coarseness of all connecting lines connected by each graph node;
selecting a graph node with the maximum connectivity as the intermediate node;
selecting a graph node with the largest weight as the intermediate node when several graph nodes have the same connectivity; and
selecting a graph node with the largest dispersion as the intermediate node when several graph nodes have the same connectivity and weight.