REVIEW 19 cited by
PyMatching: A Python package for decoding quantum codes with minimum-weight perfect matching
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
PyMatching: A Python package for decoding quantum codes with minimum-weight perfect matching
read the original 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.
Forward citations
Cited by 19 Pith papers
-
Proof of a finite threshold for the union-find decoder
Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.
-
Cultivating logical catalysts for fault-tolerant dyadic phase rotations
A new cultivation protocol prepares reusable logical catalysts as eigenstates of high-period Clifford circuits to implement exact Z^{2^{-b}} phase gates with constant online depth in surface codes.
-
Magic state cultivation: growing T states as cheap as CNOT gates
Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.
-
Approximating optimal decoding of quantum LDPC codes with narrow frontiers
The Frontier decoder approximates optimal quantum LDPC decoding via narrow-frontier dynamic programming, achieving near-optimal thresholds for surface and color codes plus state-of-the-art circuit-level performance wi...
-
Coset Ensemble Decoder for Quantum Error Correction with Algorithm-Hardware Co-Design
Presents a coset ensemble decoder with algorithm-hardware co-design that claims better accuracy-latency trade-off and lower FPGA resource use than MWPM and UF baselines under depolarizing noise.
-
Programmable Dissipation via Partial Quantum Error Correction
Partial quantum error correction enables compilation of target dissipators into effective logical dynamics via randomized decoder/recovery operations in fault-tolerant rounds.
-
Real-time Surface-Code Error Correction Using an FPGA-based Neural-Network Decoder
An FPGA-based neural-network decoder achieves 550 ns deterministic closed-loop latency for real-time distance-3 surface code error correction on a superconducting processor, matching offline decoding performance.
-
Low-valency scalable quantum error correction with a dynamic compass code
A new measurement schedule turns the heavy-hex subsystem code into the dynamic compass code, which demonstrates a threshold for stability and supports fault-tolerant lattice surgery.
-
Correlated Atom Loss as a Resource for Quantum Error Correction
A new decoder exploiting correlated atom loss in surface codes raises the loss threshold from 3.2% to 4% and cuts logical errors by up to 10x for neutral-atom processors.
-
Fair Decoder Baselines and Rigorous Finite-Size Scaling for Bivariate Bicycle Codes on the Quantum Erasure Channel
Bivariate bicycle codes achieve an asymptotic threshold of approximately 0.488 on the quantum erasure channel with BP-OSD decoding, offering modest threshold edge and 12x lower overhead than toric codes under fair baselines.
-
Syndrome aware mitigation of logical errors
Conditioning logical error mitigation on the measured error-correcting syndromes cuts sampling overhead exponentially and can make error correction useful above its standard pseudo-threshold.
-
Nonlinear photonic architecture for fault-tolerant quantum computing
A photonic fault-tolerance architecture using deterministic single-photon nonlinearities maintains surface-code loss thresholds of up to 15.1% with QPC-encoded 2-chain resource states.
-
QAdapt: A Noise-Adaptive Neural Pre-Decoding Framework for Quantum Error Correction
A continually adapted neural pre-decoder reduces logical error rate and residual matching latency versus a fixed neural baseline across 110 OOD noise settings and zero-shot on Willow.
-
Blueprint for a fault-tolerant compound photon-atom quantum architecture
Blueprint for a cavity-QED photon-atom platform that generates large-scale cluster states via atomic reuse and achieves a simulated 2.6% photon-loss threshold on the RHG lattice for fault-tolerant Clifford operations.
-
Coherent versus stochastic error injection on a repetition-code logical qubit in superconducting hardware
Experiment on transmon hardware finds no logical-fidelity difference between coherent and stochastic error injection on distance-3 and distance-5 repetition codes, contrary to free-fermion simulations; authors hypothe...
-
Soft information decoding with superconducting qubits
Soft decoding with analog measurement data raises repetition-code thresholds by 25% and reduces error rates up to 30x on superconducting qubits, with one byte per shot sufficient for near-optimal performance.
-
Quantum memory based on concatenating surface codes and quantum Hamming codes
Concatenating surface codes with quantum Hamming codes achieves high error thresholds up to the surface code limit and suppresses logical errors more effectively than surface codes with comparable overhead for interme...
-
Towards logical entanglement creation in trivalent planar architectures
Trivalent surface-code layouts can run lattice surgery without the extra data-qubit stripe used in four-valent layouts, but the simulated fidelity gain holds mainly at small distance or under assumed faster gates.
-
Neural network decoder confidence as a learned proxy for the logical gap
GNN decoder logit outperforms MWPM logical gap for post-selection, yielding lower logical error rates on surface code syndromes under circuit-level noise.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.