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

A p-bit parallel-tempering decoder in single-flux-quantum logic: simulated surface-code decoding below MWPM at 4 K

Daniel Leonforte

Published Oct 12, 2026• 0 citations
Publisher

Abstract

We describe a decoder for the rotated surface code that runs as parallel tempering on probabilistic bits (p-bits) built from single-flux-quantum (SFQ) cells at 4.2 K. The X graph is decoded first, and its result switches the weights of the Z graph to account for X–Z correlations from Y errors. The p-bits, the edge toggle cells with merger trees for up to five writers and the timing of the colour clock are simulated at circuit level in JoSIM, and the measured properties enter a GPU model of the full decoder. Over d rounds of circuit-level noise at p = 0.006, paired shot by shot, the decoder has 14 to 18 % fewer logical failures than minimum-weight perfect matching (MWPM) at d = 5 and 27 to 36 % fewer at d = 7 (two independent seeds) and, with both seeds pooled, 2.2 % (d = 5) and 4.7 % (d = 7) more failures than correlated matching. Without the weight switching its logical outcome agrees with MWPM in almost every shot, so the gain comes from the X–Z correlation step (97 to 104 % of it); a deterministic two-stage control with the same switching rule comes within 2 % of correlated matching, so most of the remaining gap is due to the sampler. At p = 0.004 and 0.008 the decoder has 15 to 48 % fewer failures than MWPM (one seed). A block of d rounds is decoded in 0.53 µs (d = 5) and 1.67 µs (d = 7). Counted from the simulated cells, the core of the d = 7 decoder (p-bits, toggle cells, splitters, mergers; control logic and wiring excluded) needs 6.82 million Josephson junctions and 11 to 22 mW under energy-efficient RSFQ (ERSFQ) biasing. The decoder is a simulation study; it has not been built. Files. P5_manuscript.pdf: the manuscript. sfq_pbit_decoder_p5.tar.gz: simulation and analysis scripts (JoSIM test benches, GPU decoder model and its patches, evaluation scripts), JoSIM raw results, per-shot logical outcomes of all decoder runs, the receipts from which every number and figure is generated, the automated number checks and a self-test that reruns all evaluations and compares them field by field with the receipts. See README.md in the archive. Licences. Text and data CC BY 4.0, code MIT. Use of AI. Large language models (Claude, Anthropic) wrote most of the simulation and analysis code, ran the simulations, searched and read the literature, produced the figures and drafted the text under the author's direction; AI agents were also used as adversarial reviewers. Every number is generated by scripts from the raw simulation output and checked automatically. Version 1.1 (4 November 2026): references to work on SFQ random number generators for stochastic computing and Bayesian networks (Yamanaka, Yoshikawa and Yamanashi, IEEE Access 2024; Yamanashi, ISS 2025) added. Results, numbers, figures, code and data are unchanged.

DOI
10.5281/zenodo.23323509

Related papers

Representation Sensitivity in Rotated Surface-Code Decoding under Correlated Pauli Noise

Ba Thien Nguyen

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.

•Oct 23, 2026•0 citations

Two-Stage Neural Residual Decoding for FastSurface-Code Quantum Error Correction

J Y Chen, Jierui Peng, Jingyi Liu

Abstract One of the critical requirements for fault-tolerant quantum computation is fast and reliable decoding,Minimum-weight perfect matching (MWPM) is a reliable surface-code decoder,but it will face long decoding time when decoding instances grow. Neural-network decoders was used to solve this problem, but large models often require costly retraining when the code distance or noise model changes.In this work, we propose a two-stage decoder that combines pretrained graph neural network (GNN) residual pre-decoding with global MWPM cleanup.The GNN receives a detector graph generated by the established decoding backend and assigns confidence scores to local correction candidates.Two staggered layers of parallel local windows process confidence corrections.The residual syndrome is passed to the NVIDIA-accelerated MWPM backend.On matched batches of 32,768 samples, the complete method reduced the logical failure rate by 6.25% to 18.01% relative to Pure MWPM for code distances d=3,5,7 and 9 at physical error rates p = 0.007 to 0.013. At d=3,it decoded 3.48x – 4.38x faster over p=0.003 to 0.021. We also trained separate GNN residual pre-decoders for four circuit-level noise models over 160 code-distance/error-rate configurations and obtained 2.25x to 5.41x speedups in every case.The logical-failure benefit depended on the noise model,but the pace is all improving. Our work can accelerate surface-code decoding pace and extend to others noise models.

•Jun 25, 2026•0 citations

4-bit rapid single-flux-quantum decoder

Alex F. Kirichenko, Vasili K. Semenov, Ying Ki Kwong +1 more

We describe the design of a fast single-flux-quantum decoder which can be used, e.g., in fast RAMs, general-purpose microprocessors, and communication channel switches. The core of the circuit is a tree of the single-bit SFQ demultiplexer with toggle (rather than the reset-set) control. Three new RSFQ cells: the demultiplexer, D flip-flop with complementary outputs, and serial XOR with large parameter tolerances (dc bias margins of /spl plusmn/25%, /spl plusmn/26%, and /spl plusmn/27%, respectively) have been developed for the decoder project. We have designed the first 16-bit prototype of the decoder for 1-kA/cm/sup 2/ niobium-trilayer technology and tested it at low frequencies. The circuit was completely operable except for 3 (of 16) output SFQ/DC converters. Simulations show that the circuit should allow data rate in excess of 60 Gbit/s and channel switching time below 20 ps.>

IEEE Transactions on Applied Superconductivity•Jun 1, 1995•28 citations

Fast and accurate AI-based pre-decoders for surface codes

Christopher Chamberland, Jan Olle, Muyuan Li +2 more

Fast, scalable decoding architectures that operate in a block-wise parallel fashion across space and time are essential for real-time fault-tolerant quantum computing. We introduce a scalable AI-based pre-decoder for the surface code that performs local, parallel error correction with low decoding runtimes, removing the majority of physical errors before passing residual syndromes to a downstream global decoder. This modular architecture is backend-agnostic and composes with arbitrary global decoding algorithms designed for surface codes, and our implementation is completely open source. Integrated with uncorrelated PyMatching, the pipeline achieves end-to-end decoding runtimes of order $\mathcal{O}(1 μ\text{s})$ per round at large code distances on NVIDIA GB300 GPUs while reducing logical error rates (LERs) relative to global decoding alone. In a block-wise parallel decoding scheme with access to multiple GPUs, the decoding runtime can be reduced to well below $\mathcal{O}(1 μ\text{s})$ per round. We observe further LER improvements by training a larger model, outperforming correlated PyMatching up to distance-13. We additionally introduce a noise-learning architecture that infers decoding weights directly from experimentally accessible syndrome statistics without requiring an explicit circuit-level noise model. We show that purely data-driven graph weight estimation can nearly match uncorrelated PyMatching and exceed correlated PyMatching in certain regimes, enabling highly-optimized decoding when hardware noise models are unknown or time-varying, as well as training pre-decoders with realistic noise models. Together, these results establish a practical, modular, and high-throughput decoding framework suitable for large-distance surface-code implementations.

quant-pharXiv:2604.12841•Apr 15, 2026•23 citations

Developing a Practical Neural-Network Surface Code Decoder under Circuit-Level Noise

Aarush Pancholi

Abstract. Suppressing qubit errors is one of the main challenges in building fault-tolerant quantum computers, requiring quantum error correction to protect fragile quantum information during computation cycles. The surface code is a leading approach because of its high error tolerance and compatibility with realistic hardware, but it requires a decoder that can accurately and quickly use the syndrome measurements to discern whether a logical error has occurred. This study investigates whether a feedforward neural-network can serve as a practical decoder for the surface code under circuit-level noise. Using the Stim software package, this study generates surface code circuits at multiple code distances and physical error rates and compiles them into detector samplers, then trains a PyTorch neural-network to predict whether a logical observable flip occurred from the syndrome data. The neural-network decoder is compared against Minimum-Weight Perfect Matching (MWPM), focusing on metrics including logical error rate and inference speed. The results show that the neural-network decoder performs competitively with MWPM for code distances 3 and 5 and provides inference time advantages at higher physical error rates as its inference time remains relatively constant over increasing physical error rates. However, MWPM outperforms the neural-network at distance 7, suggesting that scalability remains a major limitation for neural-network decoders. These results show that neural-networks are a promising approach for tackling quantum error correction, although future work is still needed to improve these models for real systems at larger code distances.

•Aug 2, 2026•0 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
We describe a decoder for the rotated surface code that runs as parallel tempering on probabilistic bits (p-bits) built from single-flux-quantum (SFQ) cells at 4.2 K. The X graph is decoded first, and its result switches the weights of the Z graph to account for X–Z correlations from Y errors. The p-bits, the edge toggle cells with merger trees for up to five writers and the timing of the colour clock are simulated at circuit level in JoSIM, and the measured properties enter a GPU model of the full decoder. Over d rounds of circuit-level noise at p = 0.006, paired shot by shot, the decoder has 14 to 18 % fewer logical failures than minimum-weight perfect matching (MWPM) at d = 5 and 27 to 36 % fewer at d = 7 (two independent seeds) and, with both seeds pooled, 2.2 % (d = 5) and 4.7 % (d = 7) more failures than correlated matching. Without the weight switching its logical outcome agrees with MWPM in almost every shot, so the gain comes from the X–Z correlation step (97 to 104 % of it); a deterministic two-stage control with the same switching rule comes within 2 % of correlated matching, so most of the remaining gap is due to the sampler. At p = 0.004 and 0.008 the decoder has 15 to 48 % fewer failures than MWPM (one seed). A block of d rounds is decoded in 0.53 µs (d = 5) and 1.67 µs (d = 7). Counted from the simulated cells, the core of the d = 7 decoder (p-bits, toggle cells, splitters, mergers; control logic and wiring excluded) needs 6.82 million Josephson junctions and 11 to 22 mW under energy-efficient RSFQ (ERSFQ) biasing. The decoder is a simulation study; it has not been built. Files. P5_manuscript.pdf: the manuscript. sfq_pbit_decoder_p5.tar.gz: simulation and analysis scripts (JoSIM test benches, GPU decoder model and its patches, evaluation scripts), JoSIM raw results, per-shot logical outcomes of all decoder runs, the receipts from which every number and figure is generated, the automated number checks and a self-test that reruns all evaluations and compares them field by field with the receipts. See README.md in the archive. Licences. Text and data CC BY 4.0, code MIT. Use of AI. Large language models (Claude, Anthropic) wrote most of the simulation and analysis code, ran the simulations, searched and read the literature, produced the figures and drafted the text under the author's direction; AI agents were also used as adversarial reviewers. Every number is generated by scripts from the raw simulation output and checked automatically. Version 1.1 (4 November 2026): references to work on SFQ random number generators for stochastic computing and Bayesian networks (Yamanaka, Yoshikawa and Yamanashi, IEEE Access 2024; Yamanashi, ISS 2025) added. Results, numbers, figures, code and data are unchanged.
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.
Abstract One of the critical requirements for fault-tolerant quantum computation is fast and reliable decoding,Minimum-weight perfect matching (MWPM) is a reliable surface-code decoder,but it will face long decoding time when decoding instances grow. Neural-network decoders was used to solve this problem, but large models often require costly retraining when the code distance or noise model changes.In this work, we propose a two-stage decoder that combines pretrained graph neural network (GNN) residual pre-decoding with global MWPM cleanup.The GNN receives a detector graph generated by the established decoding backend and assigns confidence scores to local correction candidates.Two staggered layers of parallel local windows process confidence corrections.The residual syndrome is passed to the NVIDIA-accelerated MWPM backend.On matched batches of 32,768 samples, the complete method reduced the logical failure rate by 6.25% to 18.01% relative to Pure MWPM for code distances d=3,5,7 and 9 at physical error rates p = 0.007 to 0.013. At d=3,it decoded 3.48x – 4.38x faster over p=0.003 to 0.021. We also trained separate GNN residual pre-decoders for four circuit-level noise models over 160 code-distance/error-rate configurations and obtained 2.25x to 5.41x speedups in every case.The logical-failure benefit depended on the noise model,but the pace is all improving. Our work can accelerate surface-code decoding pace and extend to others noise models.
We describe the design of a fast single-flux-quantum decoder which can be used, e.g., in fast RAMs, general-purpose microprocessors, and communication channel switches. The core of the circuit is a tree of the single-bit SFQ demultiplexer with toggle (rather than the reset-set) control. Three new RSFQ cells: the demultiplexer, D flip-flop with complementary outputs, and serial XOR with large parameter tolerances (dc bias margins of /spl plusmn/25%, /spl plusmn/26%, and /spl plusmn/27%, respectively) have been developed for the decoder project. We have designed the first 16-bit prototype of the decoder for 1-kA/cm/sup 2/ niobium-trilayer technology and tested it at low frequencies. The circuit was completely operable except for 3 (of 16) output SFQ/DC converters. Simulations show that the circuit should allow data rate in excess of 60 Gbit/s and channel switching time below 20 ps.>
Fast, scalable decoding architectures that operate in a block-wise parallel fashion across space and time are essential for real-time fault-tolerant quantum computing. We introduce a scalable AI-based pre-decoder for the surface code that performs local, parallel error correction with low decoding runtimes, removing the majority of physical errors before passing residual syndromes to a downstream global decoder. This modular architecture is backend-agnostic and composes with arbitrary global decoding algorithms designed for surface codes, and our implementation is completely open source. Integrated with uncorrelated PyMatching, the pipeline achieves end-to-end decoding runtimes of order O(1μs)\mathcal{O}(1 μ\text{s})O(1μs) per round at large code distances on NVIDIA GB300 GPUs while reducing logical error rates (LERs) relative to global decoding alone. In a block-wise parallel decoding scheme with access to multiple GPUs, the decoding runtime can be reduced to well below O(1μs)\mathcal{O}(1 μ\text{s})O(1μs) per round. We observe further LER improvements by training a larger model, outperforming correlated PyMatching up to distance-13. We additionally introduce a noise-learning architecture that infers decoding weights directly from experimentally accessible syndrome statistics without requiring an explicit circuit-level noise model. We show that purely data-driven graph weight estimation can nearly match uncorrelated PyMatching and exceed correlated PyMatching in certain regimes, enabling highly-optimized decoding when hardware noise models are unknown or time-varying, as well as training pre-decoders with realistic noise models. Together, these results establish a practical, modular, and high-throughput decoding framework suitable for large-distance surface-code implementations.
Abstract. Suppressing qubit errors is one of the main challenges in building fault-tolerant quantum computers, requiring quantum error correction to protect fragile quantum information during computation cycles. The surface code is a leading approach because of its high error tolerance and compatibility with realistic hardware, but it requires a decoder that can accurately and quickly use the syndrome measurements to discern whether a logical error has occurred. This study investigates whether a feedforward neural-network can serve as a practical decoder for the surface code under circuit-level noise. Using the Stim software package, this study generates surface code circuits at multiple code distances and physical error rates and compiles them into detector samplers, then trains a PyTorch neural-network to predict whether a logical observable flip occurred from the syndrome data. The neural-network decoder is compared against Minimum-Weight Perfect Matching (MWPM), focusing on metrics including logical error rate and inference speed. The results show that the neural-network decoder performs competitively with MWPM for code distances 3 and 5 and provides inference time advantages at higher physical error rates as its inference time remains relatively constant over increasing physical error rates. However, MWPM outperforms the neural-network at distance 7, suggesting that scalability remains a major limitation for neural-network decoders. These results show that neural-networks are a promising approach for tackling quantum error correction, although future work is still needed to improve these models for real systems at larger code distances.
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.