- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper asks whether neural decoders trained on reset-bounded quantum memory experiments retain their advantage when used for interior-window decisions in a continuous syndrome stream. Using fixed-representative parity increments as targets and a common syndrome cutoff, the authors show ranking reversals relative to correlated matching and recovery through interior-window training. They also study frame-readout composition in lattice surgery. The results show that improvements in individual components do not necessarily improve conditional parity after composition, and that joint supervision can improve the composed decision. The evaluation includes simulated streams, controlled training interventions, and experiments on device records.
Critical strengths
-
Distinguishing reset-bounded memory decoding from interior-window decisions helps assess claims about deployment. Table 1 reports relative reductions of approximately 40% to 45% in buffered per-commit error compared with correlated matching using the same lookahead. Controls for continued memory training, history length, and boundaries, together with checks of the matching implementation, make these gains more convincing for the task studied.
-
The frame-readout experiments show that reducing component error does not necessarily improve conditional parity after composition. The matched comparison of joint and separate supervision at supports training and evaluating the composed target directly. This provides useful evidence for assessing modular decoding systems, where component rankings alone may be misleading.
Critical weaknesses
-
The abstract should define more precisely what it means to make existing decoders "stream-ready." The reported gains concern local and conditional targets. Their implications for complete correction with an estimated incoming frame remain untested. Section 4.3 evaluates the block contribution , where is the reference parity of the noisy state at the start of the block. As the authors explicitly note, complete correction relative to an ideal input reference also requires the incoming frame:
The current surgery experiment does not directly test composition with an estimated incoming frame. For and , the complete error probability satisfies
A lower error rate for alone therefore does not determine decoder rankings for the complete operation. The paper itself reports a reversal after composition, which gives a concrete reason to examine this issue. Figure 15 and the device-data experiments provide complementary evidence, but do not directly answer this question for surgery with an estimated incoming frame.
This is a limitation of the operational interpretation, not an objection to the conditional target or an allegation of label leakage. Conditional block correction can be useful in its own right, but the paper should state more clearly which conclusions about continuous operation its results support. A comparison confined to the existing surgery circuit, using an estimated incoming frame, or a convincing argument for the significance of the explicitly limited conditional task could materially change my assessment.
-
Claims about the role of boundaries should stay within what the controls establish. Moving from memory experiments to interior-window prediction changes preparation conditions, access to final readout, and supervision. Failure of the original weights therefore shows a transfer difficulty between tasks; it does not invalidate their original memory performance, which Table 1 confirms.
The boundary controls provide more information than a simple fine-tuning comparison. In Appendix B.2, the shorter-sequence control reduces the nominal input length from to while keeping the full predecessor history accessible to the target window. Figure 3(a) calls this condition "Shorter history," but readers must consult Appendix B.2 to see that the accessible predecessor history is unchanged. The caption should make this distinction explicit. This control does not rule out effective-context-length explanations in general, and its implications should be distinguished from those of the separate history-length experiments.
Preparation/readout interventions also change the detector-label pair. These are valid interventions on the overall boundary treatment, but, as Appendix B.2 acknowledges, they do not isolate the effects of input statistics, label semantics, and effective context.
Please specify which alternative explanations each control rules out and qualify the abstract's attribution to preparation and terminal-readout boundaries "rather than sequence length" accordingly. The conclusion should distinguish nominal input length from accessible predecessor history. It should also distinguish the overall effect of a boundary treatment from the separate contributions of the resulting detector and label distributions. Since the central diagnosis motivates the proposed training procedure, I am asking for its scope to be made explicit, without requiring an exhaustive decomposition of these mechanisms.
Questions for authors
-
Which conclusions about the complete operation are supported by the conditional target evaluated here? Have you evaluated , with estimated from a noisy prefix, and compared against matching under the same syndrome cutoff? If available, a limited evaluation within the existing surgery setup would directly address my first concern. I am not asking for a complete multi-gate algorithm.
-
Which alternative explanations are ruled out by the nominal-input-length control in Figure 3(a), the history-length study in Figure 3(b), and the preparation/readout interventions, respectively? How should the abstract's attribution to boundaries "rather than sequence length" be qualified in light of these controls?
5 comments
Thank you for the detailed response. The complete-correction results and the split between readout inputs and labels address my main concerns. I also agree that the available public data do not permit validation on a continuous hardware record. I’m raising my score to 3.
Please address the following in the final version.
-
The revised PDF is missing both the Limitations paragraph described in your general response and the complete-correction results at p = 0.003 from your follow-up. Please add both, along with the d = 9 complete-correction result once available. Include shot counts and confidence intervals for the complete-correction results.
-
At p = 0.003, the memory-trained entries in Table 12 and all neural conditions in Figure 10(d–f) are each based on a single training run. Please report how much the results vary across independent runs.
-
On interior commits, the device results are roughly on par with matching and slightly worse at d = 5 with 30 rounds (Table 4). The whole-run comparison in Table 17 uses the memory-benchmark metric that the paper argues against. Please avoid citing that comparison as evidence for stream decoding.
-
In the abstract, please specify that the 40–45% figure is a per-commit result and report the complete-correction gains of 1.7–7.3% separately.
-
My understanding is that the circuit-level depolarizing noise used throughout is the standard uniform noise model. Please include results under an additional noise model, such as SI1000. SI1000 more closely reflects superconducting hardware and gives measurement errors much greater weight, which matters because your diagnosis focuses on the terminal readout layer.
Thank you sincerely for raising your score and for reading our responses and revised PDF so carefully. Your feedback directly shaped the paper. Both the complete-correction evaluation with an estimated incoming frame and the split of the readout boundary came from your questions, and they made our claims much stronger.
The run we promised has now finished. At , our complete-correction error is 0.399 compared to 0.406 for matching.
In the final version, we will include this result, the numbers and the Limitations paragraph, with shot counts and confidence intervals for every complete-correction result. We will also report the spread across independent training runs and the SI1000 noise tests for our readout-layer diagnosis, alongside the requested edits to the abstract and the device-result descriptions.
Thank you again for your time and thoughtful review.
Dear Reviewer uZ6u,
As the discussion period is nearing its end, we want to check that our responses have addressed your concerns.
Our central finding is that decoder rankings on memory benchmarks reverse on continuous streams. The cause is the boundaries inside the scored window. Training on interior windows restores the lead, both as fine-tuning and from scratch. Neural decoders today are mostly benchmarked on memory experiments. Our results provide a basis for evaluating and training them on the continuous streams that fault-tolerant computation runs on.
We have since scored the complete correction at p=0.003, below threshold. We used the same recipe as in Table R1.
If you have further questions, please let us know.
Thank you for your time and effort in reviewing our paper!