Quant-S: a small neural decoder with ternary weights, tested on Sycamore surface-code data

We report Quant-S, a neural decoder for surface-code memory experiments with 3.6million parameters, of which 3.15 million are ternary weights in the feed-forward blocks. Itreads syndromes round by round with a recurrent state and needs no GPU at inferencetime. We trained it only on simulated syndromes drawn from Google's published detectorerror models and tested it on the held-out half of Google's 2023 Sycamore distance-5experiment (Z basis, 5, 11, 17 and 25 rounds, 25,000 shots each). In both of two trainingseeds, Quant-S has a lower logical error rate than PyMatching at 5, 11 and 17 rounds(absolute reductions 0.011 to 0.023, paired exact McNemar p ≤ 5 × 10⁻⁷) and matches it at25 rounds. Its logical error per round is 3.90 % and 3.96 % for the two seeds, against 4.21% for PyMatching, 3.50 % for correlated matching, 2.94 % for belief matching and 2.82 %for tensor-network decoding on the same shots. A float model of the same size trainedthe same way reaches correlated matching at 17 rounds. On one laptop CPU core thedecision after the last round takes a median of 155 to 181 µs. Quant-S is therefore not themost accurate decoder on this data. Its point is that a decoder this small, with mostlyternary weights, already beats standard matching on real hardware data and runs fastenough for platforms with millisecond cycles, such as trapped ions.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24361820
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Quant-S: a small neural decoder with ternary weights, tested on Sycamore surface-code data

Ziedonis Valbergs
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
preprint

Quant-S: a small neural decoder with ternary weights, tested on Sycamore surface-code data

Ziedonis Valbergs
preprint en

Abstract

We report Quant-S, a neural decoder for surface-code memory experiments with 3.6million parameters, of which 3.15 million are ternary weights in the feed-forward blocks. Itreads syndromes round by round with a recurrent state and needs no GPU at inferencetime. We trained it only on simulated syndromes drawn from Google's published detectorerror models and tested it on the held-out half of Google's 2023 Sycamore distance-5experiment (Z basis, 5, 11, 17 and 25 rounds, 25,000 shots each). In both of two trainingseeds, Quant-S has a lower logical error rate than PyMatching at 5, 11 and 17 rounds(absolute reductions 0.011 to 0.023, paired exact McNemar p ≤ 5 × 10⁻⁷) and matches it at25 rounds. Its logical error per round is 3.90 % and 3.96 % for the two seeds, against 4.21% for PyMatching, 3.50 % for correlated matching, 2.94 % for belief matching and 2.82 %for tensor-network decoding on the same shots. A float model of the same size trainedthe same way reaches correlated matching at 17 rounds. On one laptop CPU core thedecision after the last round takes a median of 155 to 181 µs. Quant-S is therefore not themost accurate decoder on this data. Its point is that a decoder this small, with mostlyternary weights, already beats standard matching on real hardware data and runs fastenough for platforms with millisecond cycles, such as trapped ions.

Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon