Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2606.08758

Neural network decoder confidence as a learned proxy for the logical gap

David Dentelski

quant-phSubmitted Jun 7, 2026• Announced Jun 9, 2026• 8 citations• Revised Aug 19, 2026 (v3)
v1 · Jun 7, 2026v2 · Jun 24, 2026v3 · Aug 19, 2026
arXivHTMLPDF

Abstract

To utilize quantum error-correcting codes, a decoder must infer the logical sector from the measured syndrome. Beyond a hard logical decision, some decoders provide soft information estimating its reliability. For minimum-weight perfect matching (MWPM), a common confidence measure is the complementary, or logical, gap. Neural-network decoders trained with binary cross entropy naturally output a different score, the logit, whose relation to the matching gap remains unclear. Here, we test whether the logit of a graph neural network (GNN) decoder behaves as a learned proxy for the logical gap. Using a pretrained GNN for the rotated surface code under uniform circuit-level noise [PRR, 7(2):023181, 2025], we compare its logit with the MWPM gap shot by shot on identical syndromes. The native GNN decoder-logit pair yields a lower post-selected logical error rate than the native MWPM decoder-gap pair over the operationally relevant range of acceptance rates. Exchanging the scores between decoders isolates score discrimination from hard-decision accuracy and shows that both contribute to the advantage. At larger distances each score best ranks failures of its own decoder, whereas at small distance, where the bounded matching gap saturates, the learned confidence better discriminates MWPM failures than the gap itself. Finally, GNN confidence is substantially better described by the posterior logistic form implied by an ideal log-likelihood ratio, while the MWPM gap shows systematic departures. Thus, a neural-network decoder trained only on syndromes and logical labels learns a gap-like confidence proxy whose native scale more closely follows the expected posterior calibration form, supporting learned soft output when MWPM gap estimates are unavailable, costly, or insufficiently expressive.

Comments
Major revisions. Added post-selected exchange confidence in new Fig. 2. Total of 4 figures in the Main text. Added three appendices (total of four), with additional information

Related papers

Neural Minimum Weight Perfect Matching for Quantum Error Codes

Yotam Peled, David Zenati, Eliya Nachmani

Realizing the full potential of quantum computation requires Quantum Error Correction (QEC). QEC reduces error rates by encoding logical information across redundant physical qubits, enabling errors to be detected and corrected. A common decoder used for this task is Minimum Weight Perfect Matching (MWPM) a graph-based algorithm that relies on edge weights to identify the most likely error chains. In this work, we propose a data-driven decoder named Neural Minimum Weight Perfect Matching (NMWPM). Our decoder utilizes a hybrid architecture that integrates Graph Neural Networks (GNNs) to extract local syndrome features and Transformers to capture long-range global dependencies, which are then used to predict dynamic edge weights for the MWPM decoder. To facilitate training through the non-differentiable MWPM algorithm, we formulate a novel proxy loss function that enables end-to-end optimization. Our findings on the toric code under depolarizing noise demonstrate thresholds of 17.9% and 10.95%, nearing the 18.9% and 11.0% maximum likelihood bounds, highlighting the advantage of hybrid decoders that combine the predictive capabilities of neural networks with the algorithmic structure of classical matching.

quant-pharXiv:2601.00242•Jan 2, 2026•3 citations

Neural Syndrome Decoding Versus Minimum-Weight Matching: A Controlled Benchmark for Quantum Repetition Codes

Srinivasa Rao Gundu, Swathi Jarapla

Learned decoders are often proposed as a faster, more adaptable replacement for minimum-weight perfect matching (MWPM) in quantum error correction, yet published comparisons mix datasets, noise levels and metrics, and many omit a matching baseline altogether. This paper contributes a controlled benchmark in which a multilayer perceptron (MLP), a two-layer LSTM and a Transformer encoder are trained and tested on identical Stim-generated repetition-code data (distances 3 to 11, circuit-level depolarizing noise, five measurement rounds) under one training protocol, and are scored against MWPM and a trivial majority-class predictor over five independent seeds. We report logical error rate, balanced accuracy, F1 for the logical-error class and ROC-AUC rather than raw accuracy, because roughly 12% of shots at a physical error rate of 0.05 (and under 1% at 0.003) carry a logical flip, so a decoder that never predicts an error already scores 88% (99.2% at the lower rate). With 3,200 training shots, none of the neural decoders matches MWPM at any distance. MWPM drives the logical error rate from 4.3% at distance 3 to nearly zero at distance 11, whereas the neural decoders stay between 5% and 12% and the MLP falls back to the majority prediction once the syndrome has 60 bits. Presenting the temporal structure of the syndrome to the network, one token per measurement round, gives the largest and most consistent gain, and a Transformer fed scalar detector tokens without positional information collapses. We also examine the effect of training-set size, a shift in test-time noise, and decoding latency, and we discuss which conclusions the data do and do not support.

International Journal of Scientific Research in Computer Sciences and Engineering•Oct 31, 2026•0 citations

Graph Neural Post-selection for Quantum Error Correction

Conor Carty, Tamas Noszko, Joschka Roffe +1 more

Post-selection improves the logical reliability of quantum computation by rejecting shots which are likely to result in logical failure. We introduce graph neural networks that predict decoder failure without additional decoder executions, using only syndromes, and for high-rate quantum low-density parity-check (qLDPC) codes, existing belief-propagation posteriors. We evaluate rotated surface and bivariate bicycle (BB) code memories under uniform depolarising circuit-level noise. Retaining 90% of shots gives approximately 3700x and 740x reductions in logical error rates for [[72,12,6]] and [[144,12,12]] BB codes at realistic physical error rates. For the distance 5 surface code at physical noise p=0.003, our neural post-selector achieves logical error suppression comparable to the leading complementary gap method without running the decoder.

quant-pharXiv:2610.00504•Oct 2, 2026•0 citations

Machine Learning Optimal Quantum Error Correction Thresholds

Dominik Seip, Luis Colmenarez, Markus Schmitt +1 more

As quantum computers remain susceptible to noise, QEC is essential for preserving logical information during computations. However, the performance of QEC codes breaks down beyond certain noise thresholds, revealing fundamental limits on their ability to protect quantum information. These limits can be characterized using information-theoretic measures such as the coherent information, which quantifies the maximum rate at which logical information can be reliably transmitted through a noisy quantum channel. In this work, we establish a direct connection between the CI and the binary cross-entropy loss used when training neural network decoders. Specifically, we show that the CI constitutes a sharp lower bound on the achievable loss for decoders that track logical operators across noisy channels. To this end, we develop a transformer-based neural network model based on maximum likelihood decoding. We train this network to estimate the CI and evaluate its performance on the surface code under three noise models: code capacity, phenomenological, and circuit-level noise. Our results demonstrate that the network accurately predicts CI and yields threshold estimates that closely match known theoretical limits. When used as a decoder, the network significantly outperforms the minimum weight perfect matching decoder in terms of logical error rate. We also introduce a novel soft post-selection scheme that independently treats uncertainty in both logical operators and relies on confidence-based filtering of the network's output. We prove that such post-selection strategies, based on the MLD cosets, are optimal, and demonstrate their scalability in terms of both logical error rate and abort probability. These findings establish transformer-based architectures as powerful tools for QEC and provide the first numerical evidence supporting the optimality and scalability of MLD-based post-selection.

quant-pharXiv:2606.22194•Jun 23, 2026•3 citations

Machine-learned syndrome post-selection for reliable quantum error correction

Tobias Haug, Askery Canabarro, Leandro Aolita

Quantum error correction can be enhanced by post-selecting out runs that are likely to produce a logical failure, but the most accurate measures for that require costly decoder-level information. We introduce a practical, decoder-agnostic post-selection method that learns directly from syndrome data. The method trains a supervised classifier to distinguish between syndromes from low- and high-noise regimes, and then uses the classifier's output as an abort score for new runs, without requiring logical-error labels, correction operators, or code-specific likelihood calculations. We validate the approach in three complementary settings: circuit-level simulations of the Gross bivariate-bicycle code, code-capacity simulations of the surface code, and experimental logical magic-state distillation data from the QuEra neutral-atom processor. In the Gross and surface codes, learned syndrome post-selection reduces the conditional logical error rate at a fixed acceptance rate, with performance comparable to syndrome-weight filtering. For the surface code, the learned classifier reveals a post-selection transition distinct from the conventional decoding threshold. In the experimental data, the machine-learning score outperforms syndrome-weight post-selection and, when combined with logical-gap filtering, improves the output fidelity beyond using the logical gap alone. These results show that syndrome-only learning provides a scalable and hardware-compatible route to improving the reliability of quantum error correction.

quant-pharXiv:2607.19563•Jul 23, 2026•5 citations

Learning to Correct Quantum Errors

Mayank Goswami, Shreeyam Bangera

Abstract Fault-tolerant quantum computers must continually decode noisy parity-check data, known as the syndrome, to determine whether an encoded logical qubit has been corrupted. The standard decoder, minimum-weight perfect matching (MWPM), assumes independent, graph-like errors and is sub-optimal under realistic circuit-level noise. We present a compact residual 3D convolutional neural network (0.5–0.6 million parameters) that reads the space-time syndrome of a rotated surface code as a volumetric image. Trained on Stim simulations at code distances d = 3 and d = 5 and evaluated on 3.6 million held-out shots, a three-seed ensemble outperforms correlated MWPM, the strongest baseline we test, at all 18 noise settings, with 6–46% fewer logical errors (paired McNemar p-value below 0.03 in every setting). On real Google Sycamore data (d = 3, five rounds), the network is pre-trained on the device's fitted error model and fine-tuned on half of the shots. It achieves a logical error rate of 13.03%, compared with 13.57% for correlated MWPM on the same held-out shots, and outperforms it on all eight cross-validation folds, although it does not match belief-matching or tensor-network decoders. Its outputs are well calibrated (ROC AUC = 0.998): discarding the 10% least-confident shots reduces errors tenfold. An ablation study identifies space-time locality as the essential inductive bias. All models train in 49 minutes on two freely available GPUs, and the data and code are publicly available.

•Nov 9, 2026•0 citations
To utilize quantum error-correcting codes, a decoder must infer the logical sector from the measured syndrome. Beyond a hard logical decision, some decoders provide soft information estimating its reliability. For minimum-weight perfect matching (MWPM), a common confidence measure is the complementary, or logical, gap. Neural-network decoders trained with binary cross entropy naturally output a different score, the logit, whose relation to the matching gap remains unclear. Here, we test whether the logit of a graph neural network (GNN) decoder behaves as a learned proxy for the logical gap. Using a pretrained GNN for the rotated surface code under uniform circuit-level noise [PRR, 7(2):023181, 2025], we compare its logit with the MWPM gap shot by shot on identical syndromes. The native GNN decoder-logit pair yields a lower post-selected logical error rate than the native MWPM decoder-gap pair over the operationally relevant range of acceptance rates. Exchanging the scores between decoders isolates score discrimination from hard-decision accuracy and shows that both contribute to the advantage. At larger distances each score best ranks failures of its own decoder, whereas at small distance, where the bounded matching gap saturates, the learned confidence better discriminates MWPM failures than the gap itself. Finally, GNN confidence is substantially better described by the posterior logistic form implied by an ideal log-likelihood ratio, while the MWPM gap shows systematic departures. Thus, a neural-network decoder trained only on syndromes and logical labels learns a gap-like confidence proxy whose native scale more closely follows the expected posterior calibration form, supporting learned soft output when MWPM gap estimates are unavailable, costly, or insufficiently expressive.
Realizing the full potential of quantum computation requires Quantum Error Correction (QEC). QEC reduces error rates by encoding logical information across redundant physical qubits, enabling errors to be detected and corrected. A common decoder used for this task is Minimum Weight Perfect Matching (MWPM) a graph-based algorithm that relies on edge weights to identify the most likely error chains. In this work, we propose a data-driven decoder named Neural Minimum Weight Perfect Matching (NMWPM). Our decoder utilizes a hybrid architecture that integrates Graph Neural Networks (GNNs) to extract local syndrome features and Transformers to capture long-range global dependencies, which are then used to predict dynamic edge weights for the MWPM decoder. To facilitate training through the non-differentiable MWPM algorithm, we formulate a novel proxy loss function that enables end-to-end optimization. Our findings on the toric code under depolarizing noise demonstrate thresholds of 17.9% and 10.95%, nearing the 18.9% and 11.0% maximum likelihood bounds, highlighting the advantage of hybrid decoders that combine the predictive capabilities of neural networks with the algorithmic structure of classical matching.
Learned decoders are often proposed as a faster, more adaptable replacement for minimum-weight perfect matching (MWPM) in quantum error correction, yet published comparisons mix datasets, noise levels and metrics, and many omit a matching baseline altogether. This paper contributes a controlled benchmark in which a multilayer perceptron (MLP), a two-layer LSTM and a Transformer encoder are trained and tested on identical Stim-generated repetition-code data (distances 3 to 11, circuit-level depolarizing noise, five measurement rounds) under one training protocol, and are scored against MWPM and a trivial majority-class predictor over five independent seeds. We report logical error rate, balanced accuracy, F1 for the logical-error class and ROC-AUC rather than raw accuracy, because roughly 12% of shots at a physical error rate of 0.05 (and under 1% at 0.003) carry a logical flip, so a decoder that never predicts an error already scores 88% (99.2% at the lower rate). With 3,200 training shots, none of the neural decoders matches MWPM at any distance. MWPM drives the logical error rate from 4.3% at distance 3 to nearly zero at distance 11, whereas the neural decoders stay between 5% and 12% and the MLP falls back to the majority prediction once the syndrome has 60 bits. Presenting the temporal structure of the syndrome to the network, one token per measurement round, gives the largest and most consistent gain, and a Transformer fed scalar detector tokens without positional information collapses. We also examine the effect of training-set size, a shift in test-time noise, and decoding latency, and we discuss which conclusions the data do and do not support.
Post-selection improves the logical reliability of quantum computation by rejecting shots which are likely to result in logical failure. We introduce graph neural networks that predict decoder failure without additional decoder executions, using only syndromes, and for high-rate quantum low-density parity-check (qLDPC) codes, existing belief-propagation posteriors. We evaluate rotated surface and bivariate bicycle (BB) code memories under uniform depolarising circuit-level noise. Retaining 90% of shots gives approximately 3700x and 740x reductions in logical error rates for [[72,12,6]] and [[144,12,12]] BB codes at realistic physical error rates. For the distance 5 surface code at physical noise p=0.003, our neural post-selector achieves logical error suppression comparable to the leading complementary gap method without running the decoder.
As quantum computers remain susceptible to noise, QEC is essential for preserving logical information during computations. However, the performance of QEC codes breaks down beyond certain noise thresholds, revealing fundamental limits on their ability to protect quantum information. These limits can be characterized using information-theoretic measures such as the coherent information, which quantifies the maximum rate at which logical information can be reliably transmitted through a noisy quantum channel. In this work, we establish a direct connection between the CI and the binary cross-entropy loss used when training neural network decoders. Specifically, we show that the CI constitutes a sharp lower bound on the achievable loss for decoders that track logical operators across noisy channels. To this end, we develop a transformer-based neural network model based on maximum likelihood decoding. We train this network to estimate the CI and evaluate its performance on the surface code under three noise models: code capacity, phenomenological, and circuit-level noise. Our results demonstrate that the network accurately predicts CI and yields threshold estimates that closely match known theoretical limits. When used as a decoder, the network significantly outperforms the minimum weight perfect matching decoder in terms of logical error rate. We also introduce a novel soft post-selection scheme that independently treats uncertainty in both logical operators and relies on confidence-based filtering of the network's output. We prove that such post-selection strategies, based on the MLD cosets, are optimal, and demonstrate their scalability in terms of both logical error rate and abort probability. These findings establish transformer-based architectures as powerful tools for QEC and provide the first numerical evidence supporting the optimality and scalability of MLD-based post-selection.
Quantum error correction can be enhanced by post-selecting out runs that are likely to produce a logical failure, but the most accurate measures for that require costly decoder-level information. We introduce a practical, decoder-agnostic post-selection method that learns directly from syndrome data. The method trains a supervised classifier to distinguish between syndromes from low- and high-noise regimes, and then uses the classifier's output as an abort score for new runs, without requiring logical-error labels, correction operators, or code-specific likelihood calculations. We validate the approach in three complementary settings: circuit-level simulations of the Gross bivariate-bicycle code, code-capacity simulations of the surface code, and experimental logical magic-state distillation data from the QuEra neutral-atom processor. In the Gross and surface codes, learned syndrome post-selection reduces the conditional logical error rate at a fixed acceptance rate, with performance comparable to syndrome-weight filtering. For the surface code, the learned classifier reveals a post-selection transition distinct from the conventional decoding threshold. In the experimental data, the machine-learning score outperforms syndrome-weight post-selection and, when combined with logical-gap filtering, improves the output fidelity beyond using the logical gap alone. These results show that syndrome-only learning provides a scalable and hardware-compatible route to improving the reliability of quantum error correction.
Abstract Fault-tolerant quantum computers must continually decode noisy parity-check data, known as the syndrome, to determine whether an encoded logical qubit has been corrupted. The standard decoder, minimum-weight perfect matching (MWPM), assumes independent, graph-like errors and is sub-optimal under realistic circuit-level noise. We present a compact residual 3D convolutional neural network (0.5–0.6 million parameters) that reads the space-time syndrome of a rotated surface code as a volumetric image. Trained on Stim simulations at code distances d = 3 and d = 5 and evaluated on 3.6 million held-out shots, a three-seed ensemble outperforms correlated MWPM, the strongest baseline we test, at all 18 noise settings, with 6–46% fewer logical errors (paired McNemar p-value below 0.03 in every setting). On real Google Sycamore data (d = 3, five rounds), the network is pre-trained on the device's fitted error model and fine-tuned on half of the shots. It achieves a logical error rate of 13.03%, compared with 13.57% for correlated MWPM on the same held-out shots, and outperforms it on all eight cross-validation folds, although it does not match belief-matching or tensor-network decoders. Its outputs are well calibrated (ROC AUC = 0.998): discarding the 10% least-confident shots reduces errors tenfold. An ablation study identifies space-time locality as the essential inductive bias. All models train in 49 minutes on two freely available GPUs, and the data and code are publicly available.