A Quantum Scaling Algorithm for Maximum-Weight Perfect Matching in General GraphsResearch Paper
The maximum-weight perfect matching (MWPM) problem asks for a perfect matching of maximum total weight in an undirected graph with integer edge weights. It is a basic primitive of combinatorial optimization. It appears directly in resource allocation, exchange markets and scheduling, and as a subroutine in Christofides' 3/2-approximation for metric TSP.…