arXiv
Open Access
2022
A distributed blossom algorithm for minimum-weight perfect matching
Eric C. Peterson
Peter J. Karalekas
Abstrak
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.
Topik & Kata Kunci
Penulis (2)
E
Eric C. Peterson
P
Peter J. Karalekas
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2022
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓