- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a syndrome-extraction architecture search framework for fault-tolerant quantum computation. It jointly optimizes CNOT ordering, subgroup-based template sharing, and selective flag-ancilla deployment, using CP-SAT for valid circuit compilation and decoder-based feedback for architecture optimization. Experiments on 20 Abelian 2BGA codes report lower logical error rates (LERs) than the compared baselines, with circuit-level distances matching the corresponding code distances in 16 instances.
Critical strengths
S1. The paper addresses an important problem in quantum error correction by jointly optimizing several interdependent circuit-design choices rather than focusing solely on gate scheduling. This formulation is technically meaningful and motivated by fault-propagation considerations. S2. The evaluation covers 20 quantum codes and reports consistent LER improvements over the compared baselines. The additional ablations on ordering optimization and flag deployment provide useful evidence for the effectiveness of the overall framework.
Critical weaknesses
W1. Although the authors use independent Monte Carlo samples for final evaluation, the sampling procedure stops at 30 decoding failures or a maximum of (10^6) shots per memory basis. Since some reported LER improvements are relatively small, clearer uncertainty estimates are needed to establish their statistical reliability. The manuscript also reports numerical circuit-distance bounds, and it would be helpful to distinguish exactly certified distances from numerical bounds. W2. The framework combines an expanded architecture search space with decoder-guided optimization, but the experimental comparisons do not fully isolate the contribution of subgroup-based architecture learning. In particular, more controlled comparisons with fixed subgroup-sharing strategies or random architecture search under matched evaluation budgets would help determine whether the improvements primarily arise from the proposed search mechanism or from increased search flexibility and computational effort.
Questions for authors
Q1. Could the authors provide uncertainty estimates or repeated independent evaluations to clarify the statistical reliability of the reported LER improvements, particularly for cases with relatively small gains? Additionally, could the authors clarify which circuit-distance results are supported by exact certificates? Q2. Could the authors further isolate the contribution of the learned subgroup-based architecture search through matched-budget comparisons with random architecture search or fixed subgroup-sharing strategies? Addressing these concerns with convincing evidence would improve my assessment.
8 comments
Response to Reviewer odsP — W1/Q1 (Part 2/2)
Exact circuit-distance certification. We further clarify that the circuit-distance values in the original submission were obtained from heuristic searches and therefore constituted upper bounds rather than exact certificates (Pryadko et al., 2022). To strengthen this evaluation, we employ the random-window (RW) and connected-cluster (CC) search procedures implemented in dist-m4ri (official method documentation; Dumer et al., 2017). RW identifies explicit undetectable logical-fault configurations, providing constructive upper bounds, while completed CC searches exclude lower-weight logical faults and establish corresponding lower bounds. When these bounds coincide, the circuit distance is exactly certified (see also Cheng et al., 2026). The calculations use the detector error models of the same final circuits evaluated above, including syndrome and flag detectors, preparation faults, and terminal measurement faults. We evaluate both X- and Z-basis memory circuits and report the smaller distance.
The additional calculations establish exact circuit distances for all 80 final circuits. Importantly, all 20 circuit-distance values of our method are confirmed to be identical to their previously reported upper bounds, with 16 of the 20 architectures preserving the corresponding code distance. In contrast, the exact distances of ASC, ASC+flag, and AlphaSyndrome are lower than their previously reported upper bounds on 10, 4, and 8 instances, respectively. With exact distances, our method outperforms ASC and AlphaSyndrome on all 20 codes, while achieving higher circuit distance than ASC+flag on 8 codes and matching it on the remaining 12.
Table 2. Original circuit-distance upper bounds and newly certified exact distances.
| Code | Code distance | SEA: original upper bound → exact | ASC: original upper bound → exact | ASC+flag: original upper bound → exact | AlphaSyndrome: original upper bound → exact |
|---|---|---|---|---|---|
| SB [[60,4,8]] w5 | 8 | 8 → 8 | 6 → 6 | 8 → 8 | 5 → 5 |
| SB [[54,4,8]] | 8 | 7 → 7 | 5 → 5 | 7 → 7 | 4 → 4 |
| SB [[60,4,9]] w7 | 9 | 9 → 9 | 7 → 6 | 8 → 8 | 5 → 5 |
| SB [[84,6,10]] | 10 | 10 → 10 | 10 → 7 | 10 → 10 | 8 → 6 |
| SB [[42,2,7]] | 7 | 5 → 5 | 4 → 4 | 5 → 5 | 3 → 3 |
| BB [[72,12,6]] | 6 | 6 → 6 | 4 → 4 | 6 → 6 | 4 → 4 |
| BB [[90,8,10]] | 10 | 10 → 10 | 7 → 6 | 10 → 9 | 7 → 6 |
| BB [[108,8,10]] | 10 | 10 → 10 | 8 → 7 | 10 → 10 | 9 → 7 |
| BB [[144,12,12]] | 12 | 12 → 12 | 10 → 7 | 12 → 10 | 10 → 6 |
| GBB [[56,6,8]] | 8 | 8 → 8 | 5 → 5 | 7 → 7 | 5 → 5 |
| GBB [[48,4,7]] | 7 | 7 → 7 | 6 → 6 | 7 → 7 | 4 → 4 |
| GBB [[72,4,8]] | 8 | 8 → 8 | 6 → 6 | 8 → 8 | 4 → 4 |
| GBB [[96,8,10]] | 10 | 10 → 10 | 10 → 7 | 10 → 9 | 8 → 7 |
| GBB [[32,2,6]] | 6 | 6 → 6 | 4 → 4 | 5 → 5 | 3 → 3 |
| GBB [[48,2,8]] | 8 | 8 → 8 | 7 → 6 | 8 → 8 | 4 → 4 |
| GBB [[64,2,10]] | 10 | 10 → 10 | 8 → 7 | 9 → 9 | 7 → 6 |
| TB [[60,4,8]] | 8 | 8 → 8 | 7 → 7 | 7 → 7 | 6 → 4 |
| TB [[84,6,10]] | 10 | 9 → 9 | 7 → 6 | 9 → 9 | 7 → 6 |
| TB [[90,8,9]] | 9 | 9 → 9 | 9 → 8 | 9 → 9 | 5 → 5 |
| TB [[128,20,8]] | 8 | 7 → 7 | 5 → 5 | 8 → 7 | 4 → 4 |
These additional evaluations address both concerns raised by the reviewer: the LER comparisons are now supported by substantially more precise independent measurements, and all reported circuit-distance results are supported by matching lower and upper bounds rather than heuristic estimates alone.
Response to Reviewer odsP — W2/Q2 (Part 1/2)
W2&Q2: Contributions of subgroup-based architecture learning and matched-budget comparisons
We thank the reviewer for this constructive suggestion. We agree that the advantages of an expanded architecture space should be distinguished from those of learning-based optimization. To address this concern, we further investigate the contributions of subgroup-based template sharing and selective flag deployment, and introduce matched-space, matched-budget random search experiments.
Search-stage ablations. We first clarify that all ablations in the original manuscript are performed during architecture search, rather than by modifying the selected circuits only at evaluation time. Specifically, the no-flag and full-flag variants fix flag deployment to zero and full coverage, respectively, while optimizing subgroup selection and CNOT ordering. The random-ordering variant samples ordering templates uniformly while retaining learned subgroup selection and flag deployment. These experiments demonstrate the importance of jointly optimizing architectural choices rather than fixing individual components.
Subgroup-based template sharing. To further examine the contribution of subgroup sharing, we conduct additional experiments with fixed numbers of sharing groups on three representative codes: SB ([[60,4,8]]), BB ([[72,12,6]]), and TB ([[84,6,10]]). Under the no-flag setting, we vary the sharing granularity from a single template per Pauli sector to independent templates for individual checks, while searching the subgroup partitions and CNOT orderings under each fixed group count. The initial screening identifies intermediate group counts of 3, 3, and 14, respectively, illustrating that neither complete sharing nor fully independent ordering is necessarily preferable. The rankings exhibit some variation under subsequent independent evaluation, indicating that the optimal sharing granularity can be sensitive to finite-shot estimation. Nevertheless, these experiments demonstrate the importance of treating template-sharing granularity as an architectural design variable.
Table 3. Fixed-group-count comparisons under the no-flag setting. LER values are from initial screening. Here, denotes the number of sharing groups in each X/Z check family.
| Code | Available group counts , including endpoints | Number of choices | Group count selected during screening | Single-group LER | Selected-group LER | No-sharing LER |
|---|---|---|---|---|---|---|
| SB [[60,4,8]] w5 | 1, 2, 3, 5, 6, 10, 15, 30 | 8 | 3 | 0.790200 | 0.773352 | 0.836521 |
| BB [[72,12,6]] | 1, 2, 3, 4, 6, 9, 12, 18, 36 | 9 | 3 | 1.137873 | 1.006674 | 1.184824 |
| TB [[84,6,10]] | 1, 2, 3, 6, 7, 14, 21, 42 | 8 | 14 | 0.248172 | 0.247442 | 0.253347 |
Selective flag deployment. We additionally examine the effect of flag coverage while fixing the selected subgroup partitions. For each flag budget, we reoptimize flag placement and CNOT ordering before compiling the complete circuit. On the three representative codes, partial coverage uses 49/60, 63/72, and 80/84 available flags, respectively, and achieves lower independently evaluated LER than full coverage, with relative reductions of 6.76%, 4.38%, and 2.55%. These results further support the benefit of jointly considering flag overhead and ordering decisions rather than always deploying the maximum number of flags.
Table 4. Independent final evaluation of partial versus full flag coverage with fixed subgroup partitions.
| Code | Fixed group count | Partial flag count (X/Z) | Full flag count (X/Z) | Partial-coverage LER | Full-coverage LER | ASC+flag LER | Reduction vs. full coverage | Reduction vs. ASC+flag |
|---|---|---|---|---|---|---|---|---|
| SB [[60,4,8]] w5 | 3 | 49 (26/23) | 60 (30/30) | 0.9445 | 1.013 | 1.080 | 6.76% | 12.55% |
| BB [[72,12,6]] | 3 | 63 (33/30) | 72 (36/36) | 1.223 | 1.279 | 1.314 | 4.38% | 6.93% |
| TB [[84,6,10]] | 14 | 80 (40/40) | 84 (42/42) | 0.2485 | 0.2550 | 0.2649 | 2.55% | 6.19% |
Response to Reviewer odsP — W1/Q1 (Part 1/2)
We appreciate the reviewer's constructive suggestions, which have helped us strengthen the experimental validation of our framework.
We thank the reviewer for highlighting the importance of statistical reliability and rigorous circuit-distance verification. We agree that the original evaluation budget of 30 decoding failures per memory basis could introduce considerable statistical uncertainty, particularly when comparing circuits with relatively small LER differences. To address these concerns, we conducted additional high-precision evaluations and exact circuit-distance calculations for all 80 final circuits across the 20 benchmark codes and four methods.
High-precision independent LER evaluation. We retain the originally selected circuits and reevaluate them using fresh Monte Carlo samples independent of the search process. The sampling target is increased from 30 to 1,000 decoding failures per memory basis, which was reached for all evaluated circuits. For failure-limited sampling, the approximate relative standard error scales as 1/F, where F denotes the number of observed failures (Mendo and Hernando, 2010). Increasing F from 30 to 1,000 therefore reduces the approximate relative standard error from 18.3% to 3.2% per memory basis. Under this substantially more reliable evaluation, our method continues to achieve the lowest observed LER among all four methods across all 20 benchmark codes. The updated average LER reductions relative to ASC, ASC+flag, and AlphaSyndrome are 31.31%, 9.82%, and 83.35%, respectively. While individual small differences should still be interpreted with their statistical uncertainty, the reevaluation confirms the overall performance advantage of our approach.
Table 1. High-precision LER results across 20 codes. All LER values in this response are in units of 10−3.