- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes QUPEGGIO, a framework combining conditional autoregressive generation and discrete diffusion repair to discover quantum error-correcting (QEC) codes. The methodology represents CSS codes as gate-level encoding circuits, enabling pre-training on existing code datasets to generate candidate circuits conditioned on physical qubits, logical qubits, and target distance. For low-distance candidates, minimum-weight logical errors are back-propagated to identify vulnerable gates, which are then localized and regenerated using a bidirectional diffusion model. Experiments show that QUPEGGIO achieves higher code distances compared to RL baselines and existing bivariate bicycle (BB) codes under a fixed QEC evaluation budget.
Critical strengths
- The generate-and-repair setup provides a practical alternative to pure RL search by reusing existing QEC constructions to initialize candidates and performing targeted diffusion updates on vulnerable gate regions. 2. Evaluating performance against exact SAT-certified distances and validating structural diversity via Quantum Weight Enumerator (QWE) classes strengthens the empirical verification of the discovered codes.
Critical weaknesses
- The feature set of encoding circuits that necessitates discrete diffusion repair over direct local search or greedy gate substitution is not clearly justified. 2. The operational workflow lacks a top-level algorithm box describing the complete sequence of training, sampling, backtracing, thresholding, and repair steps. 3. Experimental comparisons are restricted to a single primary benchmark dataset generated from QuantumClifford.jl without testing on independently constructed random or hardware-constrained codes. 4. The discussion of related works fails to address fundamental limits of sequence-based generative models when scaling to high-weight stabilizer codes.
Questions for authors
- In Section 3.1 and Section 3.3, what specific features of quantum encoding circuits make standard optimization methods unsuitable, necessitating a discrete diffusion model for localized gate repair? 2. Could the paper include a complete top-level pseudocode algorithm in Section 3 detailing all steps of autoregressive sampling, error back-tracing, Otsu thresholding, and diffusion masking? 3. In Section 4.1, the evaluation is conducted only on codes derived from the QuantumClifford.jl suite. How does the performance hold when tested on external, highly unstructured or noisy benchmarks? 4. In Figure 4 and Figure 5, the results are presented very concisely. Can the paper provide a detailed breakdown of observation points explaining gate churn and variance across training steps? 5. What are the practical limitations of QUPEGGIO when scaling to n > 500, and how can this framework impact large-scale fault-tolerant architecture design in future work?
5 comments
Response to Reviewer mmRg: Part2
Algorithm 1. Qupeggio: Generate-and-Repair Pipeline.
Each AR-generated candidate undergoes up to diffusion repair rounds ( by default), with all QEC evaluations counted toward the shared budget .
Require: Code specification ; autoregressive generator ; diffusion model ; fixed Hadamard layer ; desired check-weight constraint ; number of candidates ; repair rounds ; evaluation budget .
Ensure: Best discovered distance and corresponding circuit .
Initialization
- ; ;
- if , else if
Per-Candidate Generate-and-Repair
-
for do
-
if then break
Autoregressive Generation
-
Generate until EOS or gates, enforcing at each generation step.
Each is a CNOT gate represented by two tokens: control and target . -
Fixed Hadamard layer followed by the generated CNOT sequence. -
;
-
if then
Iterative Error-Guided Diffusion Repair
-
for do
-
if or then break
Logical-Error Back-Tracing
-
for each do
-
; for
-
for
-
end for
Otsu-Based Mask Selection
-
for
-
;
-
if then break
Diffusion Masking and Denoising
-
Mask the control and target tokens of selected CNOTs; keep all other gates and the Hadamard layer fixed. -
for do
-
Sample , enforcing ; clamp
-
end for
-
; ;
-
if then
-
if then
The improved candidate is used for error diagnosis and repair in the next round. -
end for
-
end for
-
return
Complete Algorithm Pseudocode. We provide Algorithm 1 to explicitly describe Qupeggio's end-to-end workflow, including autoregressive generation, code-distance evaluation, logical-error backtracing, Otsu-based mask selection, and diffusion repair. The algorithm also specifies the repair rounds, evaluation budget, and inference-time check-weight constraints. We will include this pseudocode in Appendix J of the revised manuscript.
Response to Reviewer mmRg: Part3
Table R4. Logical error rate per logical qubit. Improvement factors relative to the corresponding BB baseline are shown in parentheses. The lowest logical error rates for each code size are highlighted in bold.
| Code | |||
|---|---|---|---|
| BB | 6 | ||
| Ours | 8 | (5.71×) | (4.32×) |
| Ours | 10 | (13.33×) | (8.42×) |
| Ours | 12 | (7.86×) | (4.71×) |
| Code | |||
|---|---|---|---|
| BB | 6 | ||
| Ours | 8 | (1.70×) | (1.52×) |
| Ours | 10 | (0.61×) | (0.43×) |
| Ours | 12 | (0.17×) | (0.13×) |
| Code | |||
|---|---|---|---|
| BCH | 28 | ||
| Ours | 10 | (16.06×) | (15.79×) |
Check Weight and Practical Considerations. We agree that generating high-weight stabilizer codes poses challenges for sequence-based models due to increased structural complexity. However, higher stabilizer weights do not necessarily lead to better code performance and may increase syndrome-extraction complexity and decoding difficulty [1,2,3]. This motivates our focus on practical QLDPC codes with sparse stabilizers, such as BB codes [2].
We clarify that Qupeggio supports flexible check-weight constraints enforced during both autoregressive generation and diffusion repair. Beyond code distance, we further provide Table R4 to compare logical error rates under the same noise and decoding settings. Our discovered sparse-check codes achieve lower logical error rates than the high-check-weight BCH code in the evaluated settings, highlighting the practical value of controlling check weight. We will clarify these considerations in Appendix H and provide representative stabilizer generators in Appendix L of the revised manuscript.
Current Scaling Challenges and Practical Impact on Large-Scale Quantum Computing. We clarify that scaling Qupeggio beyond physical qubits is primarily limited by the computational cost of classical code-distance evaluation [2,4]. This challenge is also evident in IBM's study [2], where BB codes exceeding physical qubits are reported with distance bounds rather than exact distances. We will revise Appendix K to explicitly discuss this computational bottleneck.
We further clarify that the code sizes currently explored by Qupeggio are directly relevant to IBM's roadmap for large-scale fault-tolerant quantum computing based on modular QLDPC architectures [5,6]. For example, recent architectures adopt the BB code [2], while Qupeggio discovers a code with higher distance and lower logical error rates at the same code size and encoding rate, as shown in Table R4.
These improved codes can contribute to more capable fault-tolerant quantum hardware, which may in turn support quantum-assisted distance evaluation [7] and enable Qupeggio to explore larger codes. This suggests a promising longer-term connection between improved code discovery and quantum hardware development. We will revise Appendix K to further discuss these practical implications and future scaling opportunities.
References
[1] Sabo, Eric, et al. "Weight-reduced stabilizer codes with lower overhead." PRX Quantum 5.4 (2024): 040302.
[2] Bravyi, Sergey, et al. "High-threshold and low-overhead fault-tolerant quantum memory." Nature 627.8005 (2024): 778–782.
[3] Peham, Tom, et al. "Automated synthesis of fault-tolerant state preparation circuits for quantum error-correction codes." PRX Quantum 6.2 (2025): 020330.
[4] Kapshikar, Upendra, and Srijita Kundu. "On the hardness of the minimum distance problem of quantum codes." IEEE Transactions on Information Theory 69.10 (2023): 6293–6302.
[5] Yoder, Theodore J., et al. "Tour de gross: A modular quantum computer based on bivariate bicycle codes." arXiv preprint arXiv:2506.03094 (2025).
[6] Mandelbaum, R., Gambetta, J., Chow, J., Mittal, T., Yoder, T. J., Cross, A. W., and Steffen, M. "How IBM will build the world's first large-scale, fault-tolerant quantum computer." IBM Quantum Blog (June 10, 2025).
[7] Ismail, Refaat, Ashish Kakkar, and Anatoly Dymarsky. "Quantum annealing approach to the minimum distance problem of quantum codes." Physical Review A 114.4 (2026): 042610.
Response to Reviewer mmRg: Part1
Thank you for your thoughtful and constructive feedback! Your comments have helped us more clearly demonstrate the effectiveness of our diffusion repair strategy and the practical relevance of Qupeggio in quantum error correction. We sincerely appreciate your valuable suggestions and address your questions point by point in the following three parts.
Table R1. Best code distance for (n,k)=(144,15) under a fixed budget of Neval=1,200.
Diffusion Repair vs. Local Search. We provide Table R1 to compare diffusion repair with local search using the same error-guided masks and evaluation budget. While diffusion repair improves code distance from 12 to 15, local search provides no improvement even with additional repair rounds.
We further clarify that local search is challenging because each CNOT gate has 20,592 possible control-target choices at n=144, while the effectiveness of a modification depends on its interactions with other gates. Diffusion repair instead leverages learned construction patterns and bidirectional circuit context to propose coordinated local modifications, making more effective use of the limited evaluation budget. We will clarify this motivation and comparison in Sec. 4.4 of the revised manuscript.
Table R2. Gate churn and repair effectiveness across repair rounds at (n,k)=(144,15).
Gate Churn and Repair Effectiveness. To further clarify gate churn and variation in repair outcomes, we provide a per-round breakdown in Table R2, following the experimental setting of Figure 5. Across repair rounds, diffusion modifies only approximately 1 of editable CNOTs, while improving the code distance for roughly half of the candidates. These results demonstrate that Qupeggio achieves consistent distance improvements through localized modifications, with minimal gate churn.
Table R3. Diffusion repair of random CSS codes.
Effectiveness on Unstructured CSS Codes. We add Table R3 to evaluate Qupeggio's diffusion repair on 100 random CSS codes without predefined construction structures. The results show that Qupeggio improves code distance in ∼40 of cases, highlighting its ability to apply learned repair strategies to diverse code constructions beyond structured code families.