A distributed blossom algorithm for minimum-weight perfect matching

10/25/2022
by   Eric C. Peterson, et al.
0

We describe a distributed, asynchronous variant of Edmonds's exact algorithm for producing perfect matchings of minimum weight. The development of this algorithm is driven by an application to online error correction in quantum computing, first envisioned by Fowler; we analyze the performance of our algorithm as applied to this domain in a sequel.

READ FULL TEXT
research
05/26/2021

Lee Weight for Nonbinary Quantum Error Correction

We propose the quantum Lee weight for quantum errors, provide a Gilbert-...
research
01/12/2020

Linear programming bounds for quantum amplitude damping codes

Given that approximate quantum error-correcting (AQEC) codes have a pote...
research
03/19/2020

A Real Polynomial for Bipartite Graph Minimum Weight Perfect Matchings

In a recent paper, Beniamini and Nisan <cit.> gave a closed-form formula...
research
09/17/2022

Exact Matching and the Top-k Perfect Matching Problem

The aim of this note is to provide a reduction of the Exact Matching pro...
research
12/01/2022

The Subfield Metric and its Application to Quantum Error Correction

We introduce a new weight and corresponding metric over finite extension...
research
01/29/2019

A Pseudo-Deterministic RNC Algorithm for General Graph Perfect Matching

The difficulty of obtaining an NC perfect matching algorithm has led res...
research
05/15/2023

Fusion Blossom: Fast MWPM Decoders for QEC

The Minimum-Weight Perfect Matching (MWPM) decoder is widely used in Qua...

Please sign up or login with your details

Forgot password? Click here to reset