تقرير
A distributed blossom algorithm for minimum-weight perfect matching
العنوان: | A distributed blossom algorithm for minimum-weight perfect matching |
---|---|
المؤلفون: | Peterson, Eric C., Karalekas, Peter J. |
سنة النشر: | 2022 |
المجموعة: | Computer Science |
مصطلحات موضوعية: | Computer Science - Distributed, Parallel, and Cluster Computing |
الوصف: | 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. |
نوع الوثيقة: | Working Paper |
URL الوصول: | http://arxiv.org/abs/2210.14277 |
رقم الأكسشن: | edsarx.2210.14277 |
قاعدة البيانات: | arXiv |
كن أول من يترك تعليقا!