- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper introduces SF-QEC, a QEC decoding framework designed to handle two requirements - adaptivity and latency. The proposed method decouples the two requirements to two paths, slow and fast, both inspired by AlphaQubit 2 recurrent-transformer architecture. A decoder operates on the fast path for streaming decoding, and on the slow path a slow model extracts longer history context, the history context is transferred and fused through state fusion. The framework is evaluated on experimental distance 3 surface code data only vs MWPM, Correlated Matching, Union-Find, BP-OSD / BP-LSD, and DGR alignment / Heuristic. The framework is also evaluated vs AQ2-RT. I find the main contribution of this paper to be the slow-to-fast augmentation mechanism, which I think can be used beyond this specific architecture.
Critical strengths
- The new framework does improve decoding performance in most cases.
- The separation into slow and fast paths is well motivated.
Critical weaknesses
- The evaluation is very limited, the method is evaluated only on distance 3 surface code, it is hard to assess whether these improvements persist on a larger and more relevant scale.
Questions for authors
-
Could the authors provide evaluation on larger distance surface codes (for example 5, 7…) ?
-
The authors mentioned that SF-QEC has an additional joint training step, could the authors clarify if AQ2-RT baseline also does another training stage? If not, could they provide a comparison with additional trained AQ2-RT? Without it, it is hard to determine the source of improvement.
-
Could the authors clarify the reasoning for excluding batch 16 while including batch 8? It is unclear what the general criterion is to determine if a batch should be included or not. Could the authors also provide the results for batch 16?
2 comments
Thank you for the response and the additional experiments. The rebuttal was helpful, but it did not significantly change my overall assessment. I find the evaluation relatively limited and think that the paper would benefit from a clearer presentation of the method. I will therefore maintain my original score.
We sincerely thank the reviewer for their patience and insightful feedback.
Q1. Larger distance.
A1. We extended our experiments to distance-5 and distance-7 rotated surface codes with 10 syndrome rounds, using fast/slow widths of 64/64, a 500-shot history, and a 20-shot grouping and refresh interval. Synthetic data is generated with spatially varying sinusoidal noise. Starting from a Detector Error Model (DEM) with base circuit noise strength p, we assign error mechanisms to four spatial regions according to their detector coordinates. Each region’s mechanism probabilities follow a sinusoidal multiplier with amplitude 0.6, giving an unnormalized range of 0.4–1.6 times their original probabilities. The results are provided below, showing lower observed LER in all four settings.
Q2. Matching training budget.
A2. All AQ2-RT baselines reached early stopping before the 50-epoch budget cap, after five consecutive epochs without improvement in validation loss.
We additionally trained each AQ2-RT baseline for the same number of epochs and optimizer updates to match corresponding SF-QEC joint-training budget without early stopping, and no improvement is observed, confirming that the fairness of our training budget.
Q3. Results for batch 16.
A3. Batch 16 shows severe degradation for both MWPM and the neural decoders, with LER approaching 50% (random guessing) at r=6 and r=9. The table reports LER (%) averaged across patches 0–3, using 8,000 test shots per batch and width-64 neural models.
The degradation is likely due to severe experimental condition change, and we hereby report the results separately.