Fault-tolerant quantum computers need fast and accurate error decoding. We present CoDecoder, a small neural frontend that composes with an existing decoder to improve accuracy and reduce mean decoding time. It predicts each shot's logical outcome, retains confident predictions and routes the remaining shots to the unchanged fallback. A logical-operator-aware output head scores shifted logical operators, combining equivalent logical lines on surface codes and deciding logical qubits jointly on bivariate-bicycle (BB) codes. Fused GPU inference and efficient routing reduce the overhead paid on every shot. In registered tests under circuit-level noise, composition reduces failures by 6.4-31.4% relative to correlated matching on surface codes of distance 7-17 and by 22-50% relative to full-DEM Relay-BP on two BB codes, with 2.3-124-fold speed-ups across these comparisons. With our re-implementations of the neural decoder Cascade, composition reduces decoding time in all four settings. A joint decision of both decoders on the routed shots keeps this speed and makes the composition more accurate than Cascade in all four, with 14-18% fewer failures on the [[72,12,6]] code. On the [[72,12,6]] BB code, a conventional head with independent logical outputs fails 3.8-5.0 times as often as our joint class score under matched training conditions. Per-shot analysis shows how composition gains accuracy. On retained shots, the frontend corrects more fallback errors than it introduces, even when it is less accurate overall.
AI Summary
CoDecoder asks whether a small neural decoder can reduce both the failure rate and mean runtime of an existing decoder without changing its algorithm. It retains high-confidence logical predictions and routes other shots to the fallback. Accuracy improves precisely when the frontend makes fewer errors on retained shots; speed improves when saved fallback work exceeds frontend and routing costs.
Its logical-operator-aware output head combines equivalent logical lines on surface codes and scores joint logical-flip classes using translated operators on bivariate-bicycle (BB) codes. Fused GPU kernels support inference and routing. Neural fallbacks can additionally combine their logits with frontend scores on routed shots.
Under simulated circuit-level noise, composition reduces failures by 6.4–31.4% versus correlated matching at surface-code distances 7–17, and 22–50% versus full-DEM Relay-BP on two BB codes, with 2.3–124-fold mean-time reductions. Against Cascade reimplementations, joint decisions reduce failures in all four settings, including 14–18% on $[[72,12,6]]$. Matched-trunk ablations find independent logical outputs fail 3.8–5.0 times as often as the BB joint head. Configurations are frozen before fresh-shot tests, with paired accuracy comparisons and repeated timings.
The tests concern finite memory experiments, not ongoing computation. Sub-microsecond per-round results measure batched throughput, excluding queueing delays; composition worsens measured tail latency. Classical timings combine separately measured costs and use a fitted CPU-platform conversion. Cascade baselines are reimplementations. BB class enumeration costs $2^k$, training-seed coverage is limited, and routing assumes a known noise rate; weaker fallbacks can increase failures.
Little sign of AI-generated textStrong assumptions
Error found: The abstract does not qualify that its classical-decoder speed-up range uses composite benchmark costs with extrapolated CPU timings and omitted transfers, rather than measured end-to-end decoding latency.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
Comments
35 pages, 9 figures, 14 tables. Code, trained weights and the records of the registered tests: https://github.com/a85tract/CoDecoder
Fault-tolerant quantum computers need fast and accurate error decoding. We present CoDecoder, a small neural frontend that composes with an existing decoder to improve accuracy and reduce mean decoding time. It predicts each shot's logical outcome, retains confident predictions and routes the remaining shots to the unchanged fallback. A logical-operator-aware output head scores shifted logical operators, combining equivalent logical lines on surface codes and deciding logical qubits jointly on bivariate-bicycle (BB) codes. Fused GPU inference and efficient routing reduce the overhead paid on every shot. In registered tests under circuit-level noise, composition reduces failures by 6.4-31.4% relative to correlated matching on surface codes of distance 7-17 and by 22-50% relative to full-DEM Relay-BP on two BB codes, with 2.3-124-fold speed-ups across these comparisons. With our re-implementations of the neural decoder Cascade, composition reduces decoding time in all four settings. A joint decision of both decoders on the routed shots keeps this speed and makes the composition more accurate than Cascade in all four, with 14-18% fewer failures on the [[72,12,6]] code. On the [[72,12,6]] BB code, a conventional head with independent logical outputs fails 3.8-5.0 times as often as our joint class score under matched training conditions. Per-shot analysis shows how composition gains accuracy. On retained shots, the frontend corrects more fallback errors than it introduces, even when it is less accurate overall.
CoDecoder asks whether a small neural decoder can reduce both the failure rate and mean runtime of an existing decoder without changing its algorithm. It retains high-confidence logical predictions and routes other shots to the fallback. Accuracy improves precisely when the frontend makes fewer errors on retained shots; speed improves when saved fallback work exceeds frontend and routing costs.
Its logical-operator-aware output head combines equivalent logical lines on surface codes and scores joint logical-flip classes using translated operators on bivariate-bicycle (BB) codes. Fused GPU kernels support inference and routing. Neural fallbacks can additionally combine their logits with frontend scores on routed shots.
Under simulated circuit-level noise, composition reduces failures by 6.4–31.4% versus correlated matching at surface-code distances 7–17, and 22–50% versus full-DEM Relay-BP on two BB codes, with 2.3–124-fold mean-time reductions. Against Cascade reimplementations, joint decisions reduce failures in all four settings, including 14–18% on [[72,12,6]]. Matched-trunk ablations find independent logical outputs fail 3.8–5.0 times as often as the BB joint head. Configurations are frozen before fresh-shot tests, with paired accuracy comparisons and repeated timings.
The tests concern finite memory experiments, not ongoing computation. Sub-microsecond per-round results measure batched throughput, excluding queueing delays; composition worsens measured tail latency. Classical timings combine separately measured costs and use a fitted CPU-platform conversion. Cascade baselines are reimplementations. BB class enumeration costs 2k, training-seed coverage is limited, and routing assumes a known noise rate; weaker fallbacks can increase failures.
Foundation decoders, a class of high-capacity neural decoders, are leading candidates for fault-tolerant quantum computing, with accurate and efficient decoding at large code distances. However, their construction often faces a steep scaling barrier, as larger code distances rapidly amplify the cost of syndrome generation and neural optimization. To address this bottleneck, here we devise neural transfer unification (NTU), a unified framework for efficient foundation decoders. A central feature of NTU is its ability to align decoding tasks across code distances via algebraic structures shared by scalable code families, which enables knowledge learned on smaller codes to accelerate large-scale decoder training. We instantiate NTU as NTU-Transformer, a transformer-based neural decoder tailored for planar surface codes and bivariate bicycle codes. For planar surface codes under circuit-level noise, NTU-Transformer outperforms correlation-aware matching on the [[361,1,19]] code and further scales to the [[625,1,25]] code, where it exceeds standard matching through transfer adaptation. For the bivariate bicycle code with [[72,12,6]], it surpasses Relay-BP in the low-physical-error regime. These results establish our proposal as a scalable route to amortized cross-distance training of foundation decoders for fault-tolerant quantum processors.
Fault-tolerant quantum computers will depend crucially on the performance of the classical decoding algorithm which takes in the results of measurements and outputs corrections to the errors inferred to have occurred. Machine learning models have shown great promise as decoders for the surface code; however, this promise has not yet been substantiated for the more challenging task of decoding quantum low-density parity-check (QLDPC) codes. In this paper, we present a recurrent, transformer-based neural network designed to decode circuit-level noise on Bivariate Bicycle (BB) codes. For the [ [ 72 , 12 , 6 ] ] BB code, at a physical error rate of p = 0.1 % , our model achieves logical error rates almost 5 times lower than belief propagation with ordered statistics decoding (BP-OSD), and roughly 5 times larger than a most-likely error decoder. Moreover, while BP-OSD has a wide distribution of runtimes with significant outliers, our model has a consistent runtime and is an order-of-magnitude faster than the worst-case times from a benchmark BP-OSD implementation. On the [ [ 144 , 12 , 12 ] ] BB code, our model obtains worse logical error rates but maintains the speed advantage. These results provide initial evidence that machine learning decoders can out-perform conventional decoders on small QLDPC codes, but suggest more complex architectures and/or training procedures are necessary to scale to larger code sizes.
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.
Erasure qubits reduce overhead in fault-tolerant quantum error correction (QEC) by converting dominant faults into detectable errors known as erasures. They have demonstrated notable improvements in thresholds and scaling in surface and Floquet code memories. In this work, we use erasure qubits on Bivariate Bicycle (BB) codes from the quantum low-density parity-check (QLDPC) regime. Owing to their sparse structure and favorable rate-distance trade-offs, BB codes are practical candidates for QEC. We introduce BiBiEQ, a novel framework that compiles a given BB code into an erasure-aware memory circuit C_E. This erasure circuit C_E comprises erasure checks (ECs), resets, and erasures spread over a user-specified erasure check schedule (2EC, 4EC). BiBiEQ converts this erasure circuit C_E into the stabilizer circuit C for general-purpose decoding. BiBiEQ provides two engines for this conversion, BiBiEQ-Exact and BiBiEQ-Approx. BiBiEQ-Exact preserves the joint-erasure correlations and serves as our accuracy benchmark, while BiBiEQ-Approx uses an independence approximation to accelerate large sweeps and expose accuracy-throughput trade-offs. Using BiBiEQ, we decode the stabilizer circuits to get a per-round logical error rate (LER) for the BB codes and quantify the effect of the EC schedules on the correctable operating region below the pseudo-threshold. The 4EC schedule keeps the accuracy of both engines close to one another, making BiBiEQ-Approx a reliable proxy for BiBiEQ-Exact for faster sweeps. Below the pseudo-threshold, the code distance (d) hop from distance (d) 6 to 10 yields a drop in LER by 10-17x larger than distance (d) 10 to 12, showing that most gains are realized by d=10.
An efficient decoder is essential for quantum error correction, and data-driven neural decoders have emerged as promising, flexible solutions. Here, we introduce a diffusion model framework to infer logical errors from syndrome measurements in quantum low-density parity-check codes. Using the bivariate bicycle code with realistic circuit-level noise, we show that masked diffusion decoders are more accurate, often faster on average, and always faster in the worst case than other state-of-the-art decoders, including belief propagation with ordered statistics decoding (BP-OSD) and autoregressive neural decoders. We show that by using fewer diffusion steps during inference one can gain significant speed at minimal cost in accuracy. By examining the factored attention from our trained neural network we find that, despite being trained solely on paired samples of syndrome-logical errors, this diffusion decoder learns the structure of the quantum codes. We also compare both masked and continuous diffusion decoders on code-capacity noise models, finding that masked diffusion decoders scale better than continuous diffusion decoders.
Quantum error correction (QEC) is essential for scalable quantum computing. However, it requires classical decoders that are fast and accurate enough to keep pace with quantum hardware. While quantum low-density parity-check codes have recently emerged as a promising route to efficient fault tolerance, current decoding algorithms do not allow one to realize the full potential of these codes in practical settings. Here, we introduce a convolutional neural network decoder that exploits the geometric structure of QEC codes, and use it to probe a novel "waterfall" regime of error suppression, demonstrating that the logical error rates required for large-scale fault-tolerant algorithms are attainable with modest code sizes at current physical error rates, and with latencies within the real-time budgets of several leading hardware platforms. For example, for the [144,12,12] Gross code, the decoder achieves logical error rates up to ∼17x below existing decoders - reaching logical error rates ∼10−10 at physical error p=0.1% - with 3-5 orders of magnitude higher throughput. This decoder also produces well-calibrated confidence estimates that can significantly reduce the time overhead of repeat-until-success protocols. Taken together, these results suggest that the space-time costs associated with fault-tolerant quantum computation may be significantly lower than previously anticipated.