
Syndrome identification. Construct relevant stabilizer measurement outcomes from the input qubit outcomes.

Matching graph construction. Construct a complete graph using:

Vertices: One vertex for each unsatisfied stabilizer (include additional vertices if needed for specific boundary conditions.)

Edges: Connect every pair of vertices

Weights: The edges are assigned weights reflecting probability of the most likely error that could have given rise to the pairs of unsatisfied stabilizers. The choice of weights can be informed by the CV noise model.


Matching algorithm. Find a minimum-weight perfect matching by running Edmonds' algorithm [1]} on the matching graph from the previous step.

Qubit recovery operator. The recovery operator is given by this rule: for each pair \((u,v)\)  in the matching, flip the binary outcomes of qubits in the most likely error that could have given rise to \(u\)  and \(v\) .

