pennylane_calculquebec.utility.graph.find_largest_common_subgraph_ismags#
- pennylane_calculquebec.utility.graph.find_largest_common_subgraph_ismags(circuit: Graph, machine: Graph)#
Uses IMAGS to find the largest common graph between two graphs
- Parameters:
circuit (Graph) – the graph of the circuit
machine (Graph) – the graph of the machine
- Returns:
a mapping between the circuit’s wires and the machines qubits
- Return type:
dict[int, int]