- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces QECFM, a method for finding quantum error-correcting codes with a low logical error rate (LER) under a specified noise model and decoder. It learns a two-stage conditional flow over X/Z Tanner-Laplacian spectra, retains eigenvector bases from training examples, and uses a learned LER critic for D-Flow source optimization. A deterministic group-algebra readout enforces CSS commutativity. The experiments cover several code families, block lengths, and noise regimes. The authors report positive search results within the bivariate-bicycle (BB) family and a selected code that outperforms the Gross code under the reported code-capacity BP-OSD evaluator.
Critical strengths
-
The framework provides a practical way to search a constrained code space when objective evaluations are expensive. It combines continuous search with exact algebraic feasibility: the group-algebra readout guarantees CSS commutativity. Final candidates are evaluated through Monte Carlo decoding rather than critic predictions alone. Appendix B.2 also gives an explicit code representation whose structural properties can be checked independently.
-
The paper reports encouraging results within the BB family. Table 1 compares relevant learned and classical baselines across ten search runs under a stated online Monte Carlo budget. The median winner LER is 0.0310 for QECFM+DFlow, compared with 0.0495 for random search. Table 5 also reports non-overlapping count-based confidence intervals for the selected BB codes found by these methods at a low physical error rate. These results suggest that the learned search framework can be useful after pretraining.
Critical weaknesses
-
Several details are missing from the generation and evaluation procedures, making it difficult to trace how the reported results were obtained. Equation (13) specifies the same support size for both blocks, while the selected code in Appendix B.2 has support sizes 2 and 6. Producing the displayed parameterization from the stated rule therefore requires an additional step that is not described. This is a gap in the method specification, not evidence that the code is invalid.
Training is described only for , with eigenbases retained from training examples. Figure 5 evaluates other sizes without explaining how their bases are obtained. The evaluation also needs clarification: for the BB result at , the count ratio reported in Table 6 is , while the reported LER is . The reference to "channel-derived intervals" may account for the difference, but the paper does not define the estimator. These omissions make it difficult to verify the discovery pipeline, scaling results, and circuit-level performance.
-
The experiments do not yet establish how much each component contributes or whether the framework offers an end-to-end computational advantage. Table 1 supports improved online BB search after pretraining under a matched online evaluation budget. However, the critic uses 50,000 labeled codes, including 20,000 examples from the low-LER tail. The authors acknowledge the precomputation cost, but give too little detail on how much label acquisition costs or what reuse would be needed to amortize those costs. The readout also enumerates candidates and prioritizes the requested , while the denominator used to calculate yield and the treatment of filtering costs across methods remain unclear. These gaps limit both the comparison of total computational costs and the attribution of gains to the spectral proposal, critic-guided optimization, and candidate selection by the readout.
The architecture also needs a more targeted comparison. Within the Abelian BB training family, the X/Z Tanner graphs are isomorphic and have identical Laplacian spectra. The experiments do not isolate the benefit of the second conditional flow over a tied-spectrum alternative. Table 4 provides evidence that D-Flow guidance helps, but the independent-search and candidate-selection protocols need clarification to judge how robust this benefit is.
Questions for authors
-
Does the implementation use independent support sizes for the two blocks, or apply an additional transformation that reconciles Equation (13) with the support sizes 2 and 6 in Appendix B.2? Please describe the actual candidate-generation procedure. How are eigenbases obtained for in Figure 5, and does this require additional data or training?
-
What counts toward the 600-evaluation budget, and at what stage is raw target- yield measured? Please specify each method's search domain, target- screening rules, and treatment of rejected or intermediate candidates. How were the 50,000 critic labels, including the examples from the low-LER tail, obtained? Please report offline and online costs separately and explain the intended reuse conditions.
-
Given the identical X/Z Tanner-Laplacian spectra in the BB training family, what benefit does the second conditional flow provide over a tied-spectrum alternative? A focused control retaining the eigenbases, critic, readout, and evaluation budget would help isolate its contribution. Can the existing run-level results quantify the gains and their uncertainty for QECFM+DFlow relative to unguided QECFM and Diffusion+DFlow?
-
Which events are counted in Table 6, and what formulas convert those counts into the reported LER and confidence intervals? Please state any assumptions about joint X/Z failures. For Table 4, please clarify the noise and decoder settings, number of independent searches, and candidate-selection protocol. Do the final evaluations use fresh Monte Carlo samples independent of selection? Please also provide the existing event counts and uncertainty estimates for Table 2.
4 comments
Thank you for the response and the additional experiments. The clarifications about Eq. (13), the LER estimator, and the counts in Table 2 address my presentation concerns.
Labelling data for the critic takes about as many MC trials as 83 searches. In your reply to Reviewer ogbE, random search matches your best code at about 12× the search budget and finds a better code at 16×. The case for amortising the labelling cost still needs evidence that the critic can be reused across settings.
Proposals with the wrong k do not count towards the MC budget, so the yield ablations alone do not show whether the learned components improve search. In your reply to Reviewer J7AK, QECFM’s median LER at n = 288 is 12.5% lower than that of Gaussian sampling (0.00630 vs. 0.00720). The comparison gives neither the number of runs nor a measure of uncertainty. The ablation comparing tied and independent spectra reports yield only.
The gain over Diffusion+DFlow is within one standard deviation. The difference between the best codes found with D-Flow and unguided QECFM is not statistically significant (reply to Reviewer ogbE).
I’m keeping my original score.
Thank you for acknowledging that the implementation and evaluation clarifications address your presentation concerns. We provide additional uncertainty estimates below.
Learned proposals versus Gaussian sampling. The results reported in our response to Reviewer J7AK summarise five independent searches per method. We now additionally report the standard deviations across searches and 95% confidence intervals for the selected codes.
| Method | Median LER | SD across runs | Selected-code LER, 20k shots [95% CI] | Selected-code LER, 1M shots [95% CI] |
|---|---|---|---|---|
| QECFM | 0.00630 | 0.00334 | 0.00520 [0.00425, 0.00630] | 0.00478 [0.00464, 0.00492] |
| Gaussian | 0.00717 | 0.00111 | 0.00645 [0.00539, 0.00766] | 0.00672 [0.00656, 0.00688] |
The 20k-shot and 1M-shot columns evaluate the same selected code from each method. QECFM achieves a 12.1% lower median LER across searches and a 28.9% lower selected-code LER at 1M shots, with non-overlapping confidence intervals.
Diffusion+DFlow versus QECFM+DFlow. We constructed Diffusion+DFlow by replacing the flow-matching formulation with a diffusion formulation while retaining the remaining components. Its competitive performance demonstrates that our framework also supports diffusion. Table 1 numerically favours flow matching over diffusion. The comparison with classical search algorithms supports the benefit of the shared learned framework under the same search budget after pretraining.
Statistical evidence for the framework and for D-Flow. Under the same search budget in Table 1, a two-sided Mann–Whitney U test comparing per-search winner LERs from unguided QECFM and random search gives p < 0.005. We compare the worst-performing method in our framework with the best-performing classical search method. This provides statistical evidence for the benefit of the learned code-discovery model over random search in the evaluated setting.
The incremental contribution of D-Flow is a separate comparison. QECFM+D-Flow reduces the observed median winner LER by 14.1% relative to unguided QECFM. Furthermore, Table 4 provides complementary evidence: an independent Monte Carlo evaluation finds approximately 48% lower LER for the code selected with D-Flow than for the code selected via unguided generation.
Thank you for the additional uncertainty estimates and the comparison with random search. The comparison supports a benefit from the learned framework once it has been pretrained.
For QECFM versus Gaussian sampling, the median LER difference (0.00087) is small relative to QECFM’s standard deviation across runs (0.00334). I’m still unsure how consistently that gain holds across searches. The non-overlapping confidence intervals quantify only the Monte Carlo uncertainty for a single selected code, the same type of uncertainty you identified for the intervals in Table 4.
The 48% figure for D-Flow repeats the result in Table 4, and the gain over Diffusion+DFlow remains within one standard deviation. I still haven’t seen evidence that the critic can be reused across settings to amortise its cost, and the tied-spectrum ablation reports only yield.
I’m keeping my original score.
Rebuttal response
We thank the reviewer for the detailed technical assessment. We address implementation details, computational costs, component attribution, and statistical uncertainty.
W1 / Q1: Generation and evaluation details
Support sizes. We updated Eq. 13 to use separate wA,wB, since A and B supports are selected independently. This yields ∣A∣=2 and ∣B∣=6.
Eigenbases and scaling. QECFM generates spectral coefficients, not eigenvectors. For each block length, Tanner-Laplacian eigenbases are obtained from valid codes and fixed during generation. Experiments at n=36,72,144,288 use separate datasets and independently trained models.
Circuit-level estimator. Table 7 now reports channel-specific failures for the QECFM+DFlow BB code:
We report X/Z failures for all families and define
pL=1−(1−pX)(1−pZ),pb=eb/sb.
W2 / Q2: Component attribution, yield, and budget
Search budget and yield. Table 1 uses 600 evaluated candidates and 20,000 Monte Carlo trials per candidate, i.e. up to 12 million trials per search. Invalid or wrong-k proposals are rejected before LER evaluation, with
k=n−rank(HX)−rank(HZ),
where the ranks are computed over F2. Search continues until 600 target-k codes are found; yield is therefore 600 divided by the number of raw proposals.
Baseline distinction. QECFM, Diffusion+DFlow, and QECFM+Diffusion search in Tanner-Laplacian spectral space, whereas simulated annealing, Bayesian optimisation, and random search operate directly on the discrete polynomial code parameterisation.
Training costs. The n=144 critic dataset contains 50,067 examples, including 20,000 low-LER samples, with k=12 codes drawn uniformly from the BB parameter space. Label construction required approximately 1 billion Monte Carlo trials. We therefore report training separately and restrict search-efficiency claims to post-training discovery.
Amortisation. This cost corresponds to roughly 83 searches and can be amortised when constructing code libraries or algorithm-specific codes.
Table 4 settings. Table 4 uses depolarising code-capacity noise at p=0.003, BP-OSD decoding, and 10 independent searches per method. Final codes are selected using Monte Carlo LER estimates.
W2 / Q3: Second-field generation and D-Flow
We added the following ablation:
Independent generation improves yield by 12.2 percentage points over tied spectra, and conditioning adds a further 2.8 points. All methods share the same readout layer, so separate field representations provide greater flexibility for projection to valid CSS codes.
D-Flow and diffusion run-level advantage.
Thus D-Flow improves median final-code LER by 14.1%, while QECFM+DFlow improves by 6.8% over Diffusion+DFlow. Table 4 additionally shows a 1.92× lower selected-code LER with D-Flow guidance.
Q4: Selection protocol and uncertainty
We distinguish search-to-search variability from Monte Carlo uncertainty. Table 1 summarises independent 600-step searches using medians and standard deviations. Table 4 re-evaluates selected codes with independent Monte Carlo simulations, so its confidence intervals quantify LER-estimation uncertainty.
For Table 2, we added failure counts and 95% confidence intervals:
The full table is now in the appendix of the manuscript. The intervals do not overlap, confirming the advantage under the code-capacity noise model used for optimisation.
Table 7 instead uses channel-specific circuit-level noise. We report X and Z counts separately and combined 95% confidence intervals using
L=1−(1−LX)(1−LZ).
These additions separate Monte Carlo uncertainty from variability across independent searches.
We thank the reviewer for these questions and have incorporated the missing details into the revised manuscript. We are happy to clarify any remaing concerns and questions.