- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies an interesting and practically relevant problem: how to exploit temporal information about time-varying hardware noise to improve online surface-code decoding. The proposed framework models the noise environment as a two-state hidden Markov process, uses auxiliary observations to maintain a causal belief about the current noise regime, and uses this belief to adapt the fault probabilities/edge weights supplied to existing decoders. To support continuous operation, the paper develops a rolling decoding procedure that commits corrections from older rounds while carrying a residual-syndrome frontier forward. The authors carefully compare static, current-only, EMA, GRU, and Markov estimators and evaluate several decoder families. In the main held-out rolling experiment, the Markov approach reduces failures from 507 to 433 at d=3 and from 158 to 131 at d=5, compared with current-only calibration of the same MWPM decoder.
Critical strengths
-
Interesting and important problem. Temporal variation and correlations in hardware noise are relevant challenges for practical quantum error correction. Understanding whether knowledge of such temporal structure can actually improve logical decoding decisions is worthwhile.
-
Multiple decoder families and controls. The evaluation includes MWPM, BP+OSD, BP+LSD, and BP+UF, as well as GRU-based temporal estimation, which helps show that the observed phenomenon is not entirely tied to one particular decoder or estimator.
Critical weaknesses
-
Limited algorithmic novelty. This is my primary concern. Once the two-state temporal-noise model is assumed, the core approach consists of a standard HMM/Bayesian filter followed by existing QEC decoders whose priors or edge weights are updated according to the inferred belief. Neither the temporal inference technique nor the underlying decoders are new. Indeed, the paper explicitly states that the Bayesian filter itself is standard. The rolling-frontier construction and associated analysis add value, but I am not convinced that the overall methodological contribution is sufficiently substantial for a top-tier venue.
-
Theoretical novelty is also relatively modest. The memory-decay analysis, Brier-score identity, decision-boundary observation, and candidate-support decomposition provide useful explanations of the experiments, but most are relatively elementary consequences of the assumed probabilistic model. The rolling-decoder correctness result is more substantive, but applies to the particular short-range graph setting considered here.
-
The strongest evaluation assumes a favorable model match. The primary experiments generate noise using a two-state Markov environment and then use a two-state Markov filter to infer that environment. Prior work motivates temporally correlated noise, but the paper provides limited evidence that this specific latent-state model accurately describes realistic hardware noise. It is therefore unclear how much of the observed gain would survive substantial model mismatch.
-
Limited scale of the main surface-code experiments. The main confirmation experiments use d=3 and d=5, while d=7 appears only in additional scale diagnostics. It would be valuable to understand whether the benefit persists at substantially larger code distances.
-
Limited real-hardware evidence. The hardware component is a frozen-calibration/classical replay rather than live surface-code error correction with naturally occurring temporal noise and online adaptation. The authors appropriately acknowledge this limitation. Consequently, the main logical-error improvements remain simulation results.
-
The benefit is not uniformly robust across experimental regimes. In the long-horizon experiments, the Markov-vs-current-only differences are small and not statistically significant, and in the 30%-missing condition the Markov method actually has more failures (460 versus 450). This raises questions about the practical operating regimes in which temporal modeling provides a meaningful logical advantage.
Questions for authors
-
What is the main technical novelty beyond combining a standard HMM estimator with existing QEC decoders? Which component should be viewed as the central new algorithmic contribution of the paper?
-
How robust is the method to model mismatch? For example, what happens if the true noise has three or more latent states, continuous drift, non-Markovian dwell times, changing transition probabilities, or spatially heterogeneous temporal behavior?
-
Can the authors provide results at larger code distances? The main confirmation focuses on d=3 and d=5. Is there a reason that the logical-error advantage was not evaluated systematically at d=7 or beyond?
-
What realistic hardware signal would provide the auxiliary observations Y_t? How frequently can such information be obtained, and what latency and measurement overhead would it introduce in an actual QEC system?
-
Why does the long-horizon evaluation show substantially weaker benefits? In particular, can the authors explain when improvements in local decoding decisions should be expected to translate into improvements in long-horizon logical-memory performance?
-
Can syndrome information itself be used to estimate the hidden noise state? The current framework estimates Z_t from auxiliary observations. It would be interesting to consider P(Z_t\mid Y_{0:t},D_{0:t}), since the syndrome itself may contain substantial information about the current noise regime.
-
Can the hardware evaluation be strengthened beyond classical replay? A particularly convincing experiment would estimate temporal noise from real device telemetry and prospectively demonstrate improved decoding on subsequently collected syndrome data.
3 comments
Response to Reviewer QAxX (2/3): Model Mismatch and Code Distance
Q2: Robustness to three or more states, continuous drift, non-Markovian dwell times, changing transition rates and spatial heterogeneity?
Short answer: as suggested, we ran all five; the gain survives each, and continuous drift is the weakest case. The decoder still assumes two symmetric states; 4,096 streams each:
| your case | current-only − ours (pp, 95% CI) |
|---|---|
| three latent levels | +1.47 [0.66, 2.27] |
| four latent levels | +1.42 [0.66, 2.20] |
| continuous OU drift | +0.85 [0.05, 1.66] |
| semi-Markov dwell times | +2.39 [1.59, 3.17] |
| switching rate drifting | +2.93 [2.20, 3.69] |
| two spatial regions$^\dagger$ | +3.15 [2.32, 3.96] |
Ours keeps one belief per region, while this current-only control sees the averaged sensor. Giving the memoryless control one belief per region as well, on the same streams, isolates memory: +2.42 [1.66, 3.17] (App. B.2).
Takeaway: significant in all 12 non-IID environments (Table R2); under IID noise the decisions equal the memoryless ones.
Q3: Larger code distances?
Short answer: the advantage persists and grows in relative terms. In the submission appeared only in scale diagnostics; the revision evaluates – systematically, at a common channel scale chosen so that still fails measurably, 4,096 streams each (Table 5):
| failures | ||||
|---|---|---|---|---|
| current-only | 997 | 499 | 242 | 103 |
| ours | 860 | 392 | 187 | 72 |
| true hidden state | 852 | 381 | 179 | 69 |
| relative reduction | 14% | 21% | 23% | 30% |
Takeaway: all four 95% intervals exclude zero, and our decoder stays within 11 failures of MWPM given the true hidden state at every distance.
Q4–Q7 follow in the next comment.
Response to Reviewer QAxX (3/3): Telemetry, Long Horizons, Syndrome Information and Hardware
Q4: What signal provides , how often, and at what cost?
Short answer: any signal with a known per-regime likelihood; sparse telemetry is enough; the filter costs a few scalar operations per round. Candidates are short Ramsey or relaxation probes on spectator qubits, leakage or readout-resonator monitors, TLS spectroscopy and burst detectors (L194). The filter skips missing rounds exactly, so one value every 2, 4 or 8 rounds keeps a 1.5–1.6 pp gain (Fig. 5c).
- Measurement overhead. In our device study the probe occupies five spectator qubits and one telemetry circuit per epoch, of which the decoder uses only 8–64 of 1,000 shots; the syndrome-aware belief (Q6) needs no probe at all.
- Latency. Eq. (2) is a constant number of scalar operations per round, and commit-time smoothing costs per commit inside the wait the window already imposes. Our CPU research implementation measures 11.2 s per belief update at (App. G.4); this is not a hardware deadline, and per-round service is dominated by graph construction and matching, not by the filter (Fig. 9).
Q5: Why are long-horizon benefits weaker, and when should local improvements carry over?
Short answer: because the terminal parity saturates. Corollary 1 (L307) bounds any gain over the Bayes decoder by , so the gain must vanish as the memory approaches 50% failure, even while decisions keep differing. Exact computations show the gain first rising and then following this bound downward (Fig. 4c, Fig. 7c, Table 4). The original long-horizon conditions sat at 37–48% failure, where even the Bayes-optimal gain is only 0.24–0.35 pp. Re-run with four times as many streams, both give positive reductions (1.56 pp, ; 1.27 pp, ), and the 460-versus-450 missing-data cell does not replicate. With headroom, the long-horizon gain is large: 3.9–4.8 pp at 257 rounds with the frozen operating point, (Table 1).
Q6: Can the syndrome itself estimate ?
Short answer: yes, and we added it; its value is decoding without a sensor. The belief approximates with a Poisson likelihood of time-like coincidences versus other detection events, which track the ratio of measurement to data errors (L185). Without any sensor it lowers failures relative to the static decoder in five of six settings (: 172 → 126) but not with fast switching at (533 vs. 520), and it ties executed DGR (Table 2). Added to telemetry, it changes failures by at most 8 in either direction (Tables 1–2), so once telemetry is present the syndrome adds little regime information in our noise model.
Q7: Can the hardware evaluation go beyond classical replay?
Short answer: yes. We ran the experiment you suggested, prospectively and with native errors (Sec. 5.5, Fig. 6, App. C; General Response, Table R1). Temporal parameters are learned without labels from spectator telemetry and frozen before the 360 test epochs; a hidden two-state idle-time schedule is never shown to the decoder, so every error is the device's own.
Takeaway: on three disjoint qubit sets of two processors from different vendors, all 48 paired comparisons favour our decoder with 95% intervals above zero (WK_C180 set A: 3.75%, against 4.07–5.14% for the baselines and 3.56% for the oracle).
You are right that this is not yet closed-loop surface-code correction: the devices run repetition memories, and the regime is engineered, although every error is native (L535). Without engineering, 11.5 hours of drift (3.11M shots, Table 7) give a weaker result for our model: temporal beliefs still beat current-only decoding, but the drift is continuous, the two-regime filter selects a single regime for most qubits and gains only 0.02–0.06 pp over frozen calibration, and a Kalman filter is best (4.615% vs. 4.663% at 16 shots). We report this as it is.
Presentation. The introduction now states the two gaps explicitly (L54–69), each method section opens by naming the gap it addresses (L147, L201, L257), and Sec. 5 opens with one protocol paragraph for all studies (L345–353).
We hope these answers address your concerns, in particular the question of novelty. Please let us know if anything remains unclear; we would welcome further questions.
Response to Reviewer QAxX (1/3): Novelty
Dear Reviewer,
Thank you for an expert and thorough review. We took each of your seven questions as a concrete task, and together they account for most of the new experiments. The changes made for you carry the margin tag R3 in the revised PDF.
Summary of changes for you
You named limited algorithmic novelty as your primary concern; we address it first.
Q1: What is new beyond a standard HMM plus existing decoders?
Short answer: not the filter, and not the excess-risk identity itself. We agree that the forward filter is textbook, and the revision says so (Positioning, L137). Theorem 2(b) is the classical excess-risk identity for binary decisions (Devroye et al., 1996; App. A.2), and we agree that the original propositions were elementary; they are now auxiliary results in App. A.4. What we believe is new is what these tools yield for streaming QEC:
Takeaway, from the comparison that tests (c): against executed DGR-style reweighting on identical records, our syndrome-only belief ties DGR (all p≥.18); only when an extra regime signal exists, which DGR has no input for, does our decoder make 13–19% fewer errors, in all four settings (Table 2).
Our answers to Q2–Q3 and Q4–Q7 follow in the next two comments.