Accurate decoder priors are essential for high-performance quantum error correction. Theoretical noise models inevitably omit physically relevant error mechanisms, most notably correlated errors, which appear consistently in experimental error budgets yet are absent from standard models. We introduce a data-driven method for augmenting detector error models (DEMs) by discovering entirely new error mechanisms directly from experimental detector-firing statistics, going beyond most existing approaches that merely refine the probabilities of already-known mechanisms. Our method generates candidates by combining pairs of existing mechanisms as building blocks, then filters and validates them using pairwise and higher-order detector correlations. Crucially, this construction provides each newly discovered mechanism with a well-defined logical effect derived from the constituent error mechanisms, enabling its direct use in decoding. Furthermore, each mechanism is accompanied by a natural decomposition into lower-order components, preserving compatibility with the original decoder. This is particularly valuable in settings that rely on correlated graph-based decoders such as correlated matching. We evaluate the method on surface-code simulations with correlated noise and correlated-matching decoding, demonstrating that, in a realistic near-term noise scenario, DEM augmentation increases the Lambda parameter by 20% across code distances 7-15 and reduces the logical error rate by 75% at code distance 15 relative to the unaugmented DEM. On experimental data from Google's superconducting device, the augmented DEM increases the Lambda parameter by 9% across code distances 5-7 and yields a reduction of 14% in logical error rate over the baseline for distance 7. To our knowledge, this is the first data-driven DEM augmentation method that produces decomposed hyperedges with assigned logical effects.
Decoders for quantum error correction (QEC) experiments rely on detector error models (DEMs), which encode, for each error, its probability and the detectors and logical observables it flips. Here we show that estimating DEM event probabilities from experimental syndromes is feasible, avoids independent device benchmarking, and produces useful decoder priors for estimating and reducing decoded logical error probabilities. We evaluate our methods using open-source data from surface-code memory experiments performed on Google's Willow chip, and we carry out analogous surface-code experiments on IBM's \texttt{ibm\_miami} processor. Despite the different physical error scales of the Google and IBM devices, in both cases our estimated DEMs improve logical error probabilities relative to baseline device-informed DEMs, typically at the
5%−10% level and with larger gains in some IBM cases, without additional calibration circuits, decoder fine-tuning, or supervised fitting to logical outcomes.
Abstract We study decoder-representation sensitivity in simulated rotated surface-code Z-memory circuits with local spatially correlated XX pair events. At distance 3, ordinary minimum-weight perfect matching (MWPM) produced 4,610 versus 1,260 logical failures at p_corr = 10^-4 and 5,437 versus 2,239 at p_corr = 2 × 10^-4 on the same 500,000-shot samples using original-order versus canonical-sorted detector error models (DEMs). Across 50 additional seeded permutations per condition, failure counts varied widely. Canonical sorting tied for the minimum in this finite tested set; it is not claimed to be universally optimal. The ordering experiment reorders complete error instructions in a flattened DEM, preserving their probabilities and absolute detector and logical targets. PyMatching documents retaining the first-added logical-label set when parallel graph edges are merged; we therefore interpret the findings as a workflow-specific reproducibility result, not a newly discovered general software defect. At distances 5 and 7, correlation-aware MWPM had lower observed failure rates in all eight tested conditions, with six paired contrasts remaining significant after Bonferroni correction. An exact maximum-a-posteriori calculation gave a 0.2367% Bayes risk for the flattened-DEM distribution at p_corr = 10^-4; this is optimal for that modeled distribution only. This bounded classical simulation study proposes no new decoder, estimates no threshold, and provides no hardware evidence. Some historical source-to-result provenance remains incomplete, as disclosed in the manuscript. Code and evidence: https://github.com/tgiwn/QEC-surface-code-correlated-noise/tree/106d32e815c5f6009941afc36d3f65be7ecf35a3 Status: This is a preprint and has not undergone peer review.
We consolidate recent theoretical advances in Detector Error Model (DEM) estimation and formalize several algorithms to learn DEM parameters and structure from syndromes without using a decoder, demonstrating recovery of known DEMs from simulated syndromes with precision limited only by finite-sample effects. We then apply these algorithms to estimate DEMs from Google's 72- and 105-qubit chips. Using a likelihood function that is tractable for small DEMs, we show that DEMs estimated directly from syndromes agree more closely with unseen syndromes than DEMs trained to optimize logical performance, whereas the latter outperform the former as priors for decoders in logical memory experiments. We used a time-series of estimated DEMs to track both global error and specific local errors over the course of a QEC experiment, suggesting applications in online characterization. We employ a sequence of DEM estimation techniques to discover and quantify long-range detector correlations spanning the width of the 105-qubit chip, for which DEM analysis suggests correlated measurement errors rather than high-weight Pauli errors as the most likely explanation. Finally, we present two artifacts in repetition code syndromes that are \emph{not} well-modeled by a DEM: correlated flipping of pairs of adjacent detectors in many consecutive rounds of QEC, and signatures consistent with radiation events occurring more frequently than previously reported.
Fault-tolerant quantum computing critically relies on quantum error correction. We study surface-code decoding with diagonally correlated two-qubit
Z errors, a structured noise model that breaks assumptions leveraged by MinimumWeight Perfect Matching (MWPM). We develop a graph neural network (GNN) decoder based on learned message passing and benchmark it against a tuned MWPM baseline informed by the same noise statistics. In code-capacity simulations at code distances 3, 5, and 7, the GNN achieves consistently lower logical error rates than MWPM across the tested range of pair-error probabilities. The GNN correction threshold is about 2.5%, surpassing the 2.4% achieved by the MWPM baseline. These results indicate that data-driven message passing can adapt to complex, geometry-dependent noise without hand-crafted correlation models, thereby reducing reliance on manual model specification for quantum error correction.
We present POLYMECHANON, a graph neural network (GNN) decoder for quantum error correction whose only input is the detection error model (DEM) of a quantum code under a given noise model. We represent the DEM as a tripartite graph of detectors, error mechanisms and logical observables, where every input feature is computed by using the quantum code as data rather than design choice. In this way, the same architecture decodes in principle any stabiliser code, under any noise model that can be expressed as a detection error model, once trained on the DEM. We test this approach along four directions. Firstly, on the rotated surface code the decoder outperforms correlated MWPM under both phenomenological and circuit-level noise, with up to
25% fewer logical failures. Secondly, on a family of high-rate qLDPC codes it matches BP+OSD on the smaller codes and surpasses it on the larger ones, with up to
16% fewer logical failures on
[[130,4,6]]. Thirdly, its decoding time does not depend on the physical error rate, whereas that of BP+OSD grows with it: on
[[130,4,6]] its effective cost per shot is of the order of a few ms on a single GPU against a few tens of milliseconds for BP+OSD on a single CPU core, and its fixed computational graph makes it a candidate for real-time decoding on neutral-atom processors. Finally, a single model trained across codes of different families outperforms uncorrelated MWPM on the graph-like codes seen during training and stays within
10% of BP+OSD on the others, while it tends to fail to generalize to unseen codes, particularly larger ones. Its probabilistic output enables confidence-based post-selection, lowering the logical error rate by more than an order of magnitude on the surface code while keeping more than
90% of the shots. Since only the DEM changes, new codes and noise models can be decoded without redesigning the decoder.
Characterizing the error sources of quantum devices is essential for building reliable large-scale quantum architectures and tailoring error correction codes to the noise profile of the devices. Tomography techniques can provide detailed information on the noise or quality of quantum states but are typically both computationally and experimentally intensive with respect to the system's size. For QEC experiments, however, the information captured by a detector error model is sufficient for extracting the success rate of the experiment, as well as some information about the underlying noise. In this work, we estimate Pauli noise on detector error models, including hypergraphs, using only the syndrome statistics. We apply this method to well-known codes such as the repetition, surface, and 2D color codes. Under bare-ancilla syndrome extraction, two-point correlations are enough to reconstruct the detector error model for repetition or surface codes. For color codes or repetition codes under Steane-style syndrome extraction, we show how to extend the estimation method to multi-point correlators and extract the error rates of the hypergraphs. Finally, we find an increase in logical error suppression when we calibrate the decoder to noise fluctuations typically present in experiments.