PhysicsarXiv

Ranked by formulaVerdict: Notable

CoDecoder: Make Quantum Decoders Up to 100x Faster and Even More Accurate

Fault-tolerant quantum computers need fast and accurate error decoding.

By Guang, Xiong, Gao +1

Score████░░░░░░4.4

Key numbers

  • 124-fold speed-ups across these comparisons
  • 5.0 times as often as our
  • 31.4% relative to correlated matching

Caveats

  • Preprint; not yet peer reviewed.

VerdictWorth a reader's time today.

Read the originalPDFCode

Abstract

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.

Yicheng Guang, Yuliang Xiong, Xun Gao, Yueqi Chen

The editor's rubric

Heuristic review

Leverage4 / 5
A general-purpose tool used across several fields (Adam, ResNet, LoRA, next-generation sequencing).
18% of this desk’s rubric
Magnitude3 / 5
Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
20% of this desk’s rubric
Evidence3 / 5
Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
22% of this desk’s rubric
Novelty2 / 5
A new combination of known ideas.
22% of this desk’s rubric
Trajectory3 / 5
A clear path to scale.
10% of this desk’s rubric
Stakes2 / 5
Benefits a professional community (practitioners, clinicians, engineers).
8% of this desk’s rubric

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose); breadth (many tasks); gains (x-fold); verification (independent replication, code released); scale (efficient).

How the score was computed

rank-2026-10-18

Score████░░░░░░4.4

Score = 10 × (75% × adjusted merit / 10 + 15% × attention + 10% × freshness)

Desks place stronger verdicts first, then use this score to order work within the same verdict.

Merit
5.8 / 10
Weighted rubric, evidence-gated.
Adjusted merit
4.7 / 10
Shrunk toward the desk prior by editor confidence (40%).
Attention
0%
Citations, upvotes, points, mentions.
Freshness
86%
Half-life decay since publication.

No attention signals recorded yet.

The record

  • Reviewed by heuristic-v7 on Oct 22, 2026, 07:29 UTC. Paper type: method.
  • Categories: quant-ph
  • TOP, No.6 in the Physics edition of October 22, 2026.