Quantum Networkpowered by
searchSubscribe
Quantum Network

News, research, careers and the quantum industry, in one place.

  • alternate_email
  • search

Explore

  • Editorial
  • Research Hub
  • Events
  • Opportunities
  • About Us

Community

  • Join the Community
  • Learning Resources
  • Contact Us

Contact

A-307, Kailash Business Park,
Vikhroli (W), Mumbai – 400079

022 49646504

[email protected]

  • Newsletter
  • India Quantum Pulse
Quantum Networkpowered by
searchSubscribe
RESEARCH·Oct 22, 2026·2 MIN READ

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

arXiv:2610.28748v1 Announce Type: new 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 sur...

Source

arXiv

Author: Yicheng Guang, Yuliang Xiong, Xun Gao, Yueqi Chen

Published Oct 22, 2026

Summarised/rewritten with AI from arXiv

Read original articlearrow_forward

arXiv:2610.28748v1 Announce Type: new 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.

QUANT-PHQUBITSHARDWARE

Report a problem / takedown

ABOUT THIS STORY

Source
arXiv
Published
Oct 22, 2026
Category
RESEARCH
Read original articlearrow_forward

More from Quantum Network

RESEARCH

Local Clifford equivalence to CSS codes: Polynomial-time classification and conversion

Calderbank--Shor--Steane (CSS) codes support decoding and fault-tolerant logical operations through separate pure $X$ and pure $Z$ stabilizer checks. Generator choices and single-qubit Clifford transformations can obscure this structure. We give a deterministic polynomial-time algorithm that decides whether an arbitrary stabilizer code is locally Clifford-equivalent to a CSS code and constructs the required transformation and CSS checks whenever...

Oct 22, 2026

arrow_forward
R\'enyi multi-entropy of graph states and the $n -> 1$ limit
RESEARCH

R\'enyi multi-entropy of graph states and the $n -> 1$ limit

R\'enyi multi-entropy extends the R\'enyi entropy to pure states of more than two parties. It is defined by a replica contraction at integer replica number $n$, and the multi-entropy is its $n\to1$ limit. In holography this limit is conjectured to compute the area of a minimal soap-film web in the bulk. Understanding multi-entropy for general states, however, is harder. Unlike the bipartite case, the replica contraction is not a moment of a dens...

Oct 21, 2026

arrow_forward
Quantum error correction well below the color code threshold
RESEARCH

Quantum error correction well below the color code threshold

Quantum error correction enables scalable fault-tolerant quantum computation by suppressing logical errors exponentially with code distance once physical error rates fall below a critical threshold. Here we demonstrate below-threshold operation of triangular color codes with distances $d=3,5,$ and $7$ on Quantinuum's Helios trapped-ion quantum processor. Leveraging both circuit- and hardware- level leakage reduction schemes, we achieve logical e...

Oct 20, 2026

arrow_forward
Mechanical trisqueezing in circuit quantum acoustodynamics with SNAIL devices
RESEARCH

Mechanical trisqueezing in circuit quantum acoustodynamics with SNAIL devices

Continuous-variable quantum information processing with mechanical oscillators requires a uni- versal gate set, including a genuine non-Gaussian evolution. While circuit quantum acoustodynamics (cQAD) experiments have realized bilinear and quartic (four-wave mixing) operations by coupling mechanical modes to transmon qubits, the intrinsic Kerr nonlinearity of these devices precludes access to odd-order effective Hamiltonians such as trisqueezing...

Oct 16, 2026

arrow_forward
Quantum Network

News, research, careers and the quantum industry, in one place.

  • alternate_email
  • search

Explore

  • Editorial
  • Research Hub
  • Events
  • Opportunities
  • About Us

Community

  • Join the Community
  • Learning Resources
  • Contact Us

Contact

A-307, Kailash Business Park,
Vikhroli (W), Mumbai – 400079

022 49646504

[email protected]

  • Newsletter
  • India Quantum Pulse