Using a bipartite matching algorithm (#192)

Infleqtion · Jan 16, 2025 · 8ecf9a6 · 8ecf9a6
1 parent 72f81cc
commit 8ecf9a6
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/examples/find_optimal_communication_distance.py b/examples/find_optimal_communication_distance.py
@@ -60,7 +60,7 @@ def get_qubit_assignment(
     graph = build_placement_graph(code, folded_layout, max_comm_dist)
     if graph is None:
         return None
-    matching = nx.max_weight_matching(graph, maxcardinality=True)
+    matching = nx.bipartite.maximum_matching(graph)
     return matching if nx.is_perfect_matching(graph, matching) else None