Weighted alternating paths in graphs for quantum computing
A computer-implemented method for expanding a set of matched nodes in a partially-matched graph can include obtaining, by a computing system, a partially-matched graph having a matching set, the partially-matched graph including one or more edges and a plurality of nodes, the one or more edges having a matching label. The method can include obtaining at least two unmatched nodes. The method can include determining an alternating path from a first unmatched node of the at least two unmatched nodes to a second unmatched node of the at least two unmatched nodes, the alternating path including at least one edge of the one or more edges. The method can include inverting the matching label of the at least one edge of the alternating path such that the at least two unmatched nodes are included in the matching set of the partially-matched graph.
1. A computer-implemented method for expanding a set of matched nodes in a partially-matched graph, the method comprising:
obtaining, by a computing system comprising one or more computing devices, a partially-matched graph having a matching set, the partially-matched graph comprising one or more edges and a plurality of nodes, the one or more edges having a matching label;
obtaining, by the computing system, at least two unmatched nodes;
determining, by the computing system, an alternating path from a first unmatched node of the at least two unmatched nodes to a second unmatched node of the at least two unmatched nodes, the alternating path comprising at least one edge of the one or more edges, wherein a cost of the alternating path comprises a sum of unmatched weights of unmatched edges in the alternating path with a sum of matched weights of matched edges in the alternating path subtracted from the sum of unmatched weights; and
inverting, by the computing system, the matching label of the at least one edge of the alternating path such that the at least two unmatched nodes are included in the matching set of the partially-matched graph.
2. The method of claim 1 , wherein determining the alternating path from the first unmatched node of the at least two unmatched nodes to the second unmatched node of the at least two unmatched nodes comprises:
determining, by the computing system, a tree comprising a plurality of alternating paths from the first unmatched node to each of the plurality of nodes; and
selecting the alternating path from the tree.
3. The method of claim 2 , wherein determining, by the computing system, the tree comprising the plurality of alternating paths is performed by applying a Bellman-Ford algorithm to the partially-matched graph.
4. The method of claim 2 , wherein selecting the alternating path from the tree comprises excluding visitations to ancestors of a present node of the tree as a candidate for a next node in the tree such that none of a plurality of alternating paths comprise a cycle.
5. The method of claim 1 , wherein each of the one or more edges comprises a weight.
6. The method of claim 1 , wherein the alternating path comprises a minimum cost alternating path.
7. The method of claim 1 , wherein the matching label is indicative of one of a matched edge having a matched condition or an unmatched edge having an unmatched condition, and wherein the alternating path alternates matched edges and unmatched edges.
8. The method of claim 1 , wherein the graph is matched such that each of the plurality of nodes touches at most one matched edge.