CPC G06N 10/00 (2019.01) [G06F 15/82 (2013.01); G06F 30/327 (2020.01); G06N 10/60 (2022.01); G06N 10/70 (2022.01)] | 20 Claims |
1. A method comprising:
defining a graph including nodes mapped to qubits in a quantum device, the nodes being connected to each other by edges;
identifying sets of nodes on the graph corresponding to sets of qubits targeted by multi-qubit operations in a quantum algorithm;
defining a group of edge-disjoint paths, each path in the group being defined along one or more edges and nodes and including one of the identified sets of nodes, the group of edge-disjoint paths being defined such that no two of the paths in the group share an edge;
for each defined path, performing a set of operations to entangle the qubits corresponding to the identified set of nodes that are included in the path; and
performing the set of multi-qubit operations on the entangled sets of the qubits.
|