- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
PRIME uses a GNN to predict error probabilities from the measured syndromes, then passes these probabilities to an unchanged BP-OSD decoder. Jitter-PRIME adds several decodes with perturbed probabilities and combines the candidates by logical class. A learned gate selects which samples receive this extra computation. The paper evaluates transfer from small training codes to larger BB codes and to toric codes.
Critical strengths
Learning the inputs to an existing decoder is a useful approach. The single-decode results already improve over BP-OSD, so the gains do not all come from running more solver calls.
Using the same prior network on larger codes is a useful result. The gate also has a helpful control: it performs much better than random routing with the same average call budget.
Critical weaknesses
The circuit-level experiments use a different method from the main neural decoder. Section 4.6 perturbs native fault probabilities without using the GNN, and also changes candidate selection. These results support the perturbation ensemble, but do not show that the learned prior works under circuit-level noise.
Questions for authors
For the circuit-level results, how many baseline successes were tested with the ensemble? Could you provide confidence intervals that include uncertainty from this sampling procedure?
The gate selects the top 10% of samples within a batch. How well does a fixed threshold, chosen on separate validation data, retain the accuracy and cost benefits on the held-out codes?
Response to the Review
We thank the reviewer for the careful reading and for two well-targeted questions. Following the reviewer's suggestions, we ran both controls, and they strengthen the circuit-level results. Section, table and appendix numbers refer to the revised PDF.
W1. Circuit-level results and the learned prior
We agree with the reviewer's reading. The circuit-level experiments evaluate the perturbation ensemble and gate with native priors, and the revision makes this explicit in the section title ("Circuit-Level Decoding with Native Priors", Section 5.3) and the abstract.
The ensemble and gate are strong at circuit level: at 10% routing, the gate finds 79% of BP-OSD failures, against 30% for syndrome-weight ranking and 19% for BP non-convergence.
We also tested the GNN prior itself in the circuit-level memory experiments at p=.005, in four ways on n=144 (Appendix D.7, Table 7):
In every case the learned prior performs on par with the native prior. At circuit level the syndrome already locates most faults (simple adjacent-check counting reaches AUROC .95), which leaves little room for any prior. This confirms the reviewer's reading: the circuit-level gains come from the ensemble and gate.
Q1. Baseline successes tested, and intervals that include this sampling
Following the reviewer's suggestion, we audited every circuit-level setting (Appendix D.6, Table 6). Across all settings we ran the ensemble on 4,785 randomly sampled BP-OSD successes, and it broke only 2 of them. On the failure side no sampling was needed, since every BP-OSD failure was decoded with the ensemble. There, the ensemble corrects 75–93% of failures on n=144 at p ≥ .003 and 34–43% on n=72 at p ≥ .002, and a correct correction is in the candidate pool for 92–100% of failures.
We then recomputed the interval on the net improvement so that it accounts for all three sources of uncertainty: the baseline failure rate, the rescue rate and the damage rate, each with exact Clopper–Pearson bounds and a Bonferroni correction. At n=144 and p=.005, LER falls from 3.34% to 0.84%, a certified net gain of 1.43–3.05 percentage points at 95% confidence. The paper now reports the exact rescue fractions together with this certified result.
Q2. A fixed threshold chosen on separate validation data
The gate scores each sample by its predicted risk of failure, and in the paper it routes the top 10% of each batch to the ensemble. To remove the dependence on the batch, we fixed a single score threshold on separate n=288 calibration samples and applied it unchanged to the held-out codes at p=.10 (Appendix C, Table 3). Any sample scoring above the threshold goes to the ensemble; the rest keep the single PRIME decode.
The two LER columns are identical: the threshold already routes the samples where the ensemble makes a difference, so also running it on the low-risk remainder adds nothing. The fixed threshold therefore gives exactly the full-ensemble accuracy at 5–9× fewer solver calls, on codes it was not calibrated on.
We thank the reviewer again for these suggestions, which made the circuit-level results more precise, and we are glad to provide anything further during the discussion.