PyMatching: A Python package for decoding quantum codes with minimum-weight perfect matching

Abstract: This paper introduces PyMatching, a fast open-source Python package for decoding quantum error-correcting codes with the minimum-weight perfect matching (MWPM) algorithm. PyMatching includes the standard MWPM decoder as well as a variant, which we call local matching, that restricts each syndrome defect to be matched to another defect within a local neighbourhood. The decoding performance of local matching is almost identical to that of the standard MWPM decoder in practice, while reducing the computational complexity approximately quadratically. We benchmark the performance of PyMatching, showing that local matching is several orders of magnitude faster than implementations of the full MWPM algorithm using NetworkX or Blossom V for problem sizes typically considered in error correction simulations. PyMatching and its dependencies are open-source, and it can be used to decode any quantum code for which syndrome defects come in pairs using a simple Python interface. PyMatching supports the use of weighted edges, hook errors, boundaries and measurement errors, enabling fast decoding and simulation of fault-tolerant quantum computing.

• The paper introduces PyMatching as a robust tool that decodes quantum error-correcting codes using both standard and local minimum‐weight perfect matching algorithms.
• It demonstrates that local matching significantly reduces computational complexity while maintaining competitive decoding accuracy compared to complete graph evaluations.
• Benchmark results reveal that PyMatching’s hybrid Python and C++ implementation delivers several orders of magnitude faster performance for large-scale quantum error simulations.

Overview of PyMatching: A Python Package for Quantum Decoding

The development of PyMatching represents a significant contribution to the field of quantum error correction. This paper introduces PyMatching, a Python package dedicated to decoding quantum error-correcting codes using the Minimum-Weight Perfect Matching (MWPM) algorithm. This paper clearly delineates the context, functionality, and efficacy of PyMatching, providing comprehensive details geared toward experienced researchers in quantum computing.

Quantum error-correcting codes are essential for mitigating the effects of noise in quantum computations. In solving the decoding problem for these codes, finding a minimum-weight error that is consistent with observed syndromes is a desired outcome. While exact decoding solutions are challenging due to NP-completeness, MWPM algorithms, such as Edmonds' blossom algorithm, can efficiently solve this problem for numerous quantum code classes.

Introduction of PyMatching

PyMatching offers a streamlined and open-source solution for efficiently decoding quantum codes, particularly those that benefit from the MWPM methodology. This package includes a conventional MWPM decoder and an innovative variant called local matching. The latter offers a substantial computational advantage with only a marginal loss in decoding accuracy. Unlike the standard MWPM decoder which evaluates the complete graph of defects, local matching confines its focus to a local neighborhood around each defect. This truncation reduces computational complexity by approximately quadratic comparison while maintaining practical decoding performance.

Benchmarked Performance

The paper emphasizes PyMatching's efficiency by benchmarking its performance against other approaches like NetworkX and Blossom V implementations. Notably, local matching was shown to be several orders of magnitude faster, a critical factor considering the extensive data needed for accurate logical error rate estimation in quantum error correction simulations. The efficiency of PyMatching is underscored by its implementation in C++ while accessible through a straightforward Python interface. This hybrid development leverages the speed of C++ alongside the ease of use inherent in Python.

Technical Insights and Results

PyMatching supports a broad range of functionalities critical for practical quantum computing, such as weighted edges, boundary conditions, hook errors, and noisy syndrome measurements. This adaptability means PyMatching can decode any quantum code where syndrome defects appear in pairs, thus extending its applicability beyond specific noise models.

When evaluating the performance of the local matching algorithm, the paper delineates robust results showing that it rapidly achieves a comparable error correction threshold to exact matching even at modest levels of neighbor consideration (i.e., m < 20). Furthermore, the approximation error of local matching — defined as the frequency of outcomes deviating from exact matching — decreases significantly with a moderate increase in neighborhood size while showcasing improved logical error rates under certain conditions.

Future Directions

The speed and flexibility of PyMatching position it as a valuable tool for researchers engaged in quantum error correction. Its comprehensive support and public availability open pathways for experimentation and development in large-scale quantum simulations. Future work may involve further refinements and potential integration with quantum hardware simulators to provide real-time feedback in quantum experiments.

In conclusion, this paper presents a thorough examination of PyMatching as an effective quantum decoding resource, showcasing both its theoretical foundation and practical advantages. Researchers equipped with this package can expect to leverage a versatile tool that significantly optimizes the MWPM decoding process for quantum error-correcting codes.