- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes Commit-or-Defer (CoD), a new lightweight pre-decoder framework for quantum error correction. CoD can either commit and make a correction or defer and otherwise use its predicted posteriors to guide a classical decoder. The network uses K-hop subgraphs so that its cost will grow with active detectors rather than with the code. The method is evaluated over several code families: BB codes, surface codes, color codes and random quantum Tanner codes using MWPM, BP-OSD, and Relay-BP. The evaluation is performed under code-capacity and SI1000 noise models.
Critical strengths
- The idea of using K-hop subgraphs is well motivated.
- The model's ability to either commit or defer is an interesting design and the logical risk analysis is a compelling feature.
Critical weaknesses
- In terms of experiments, a prominent candidate for quantum computing is the BB144 code, and figure 5 shows that the method matches Relay-BP under SI1000. In addition, there is no comparison to other methods that augment classical decoders (for example for surface codes: Belief Matching or Correlated Matching).
- Framework Effectiveness: For larger codes, such as the BB144, surface d >=7 and color 11, the number of backend calls reaches around 70% and above for the upper end of physical error rates. In addition, neither wall-clock time for the network or backend nor parameter count is reported, it is therefore hard to sufficiently assess the portion of the network compared to solvers in terms of runtime.
Questions for authors
- Could the authors provide detailed wall-clock times for each stage in the process (backend and network) to assess the cost of each stage in the architecture? Also, could the authors provide a parameter count?
- In the code-capacity noise, could the authors provide the comparison for the p > 0.1?
- To better evaluate the proposed method, could the authors provide a comparison with correlation aware decoders?
- Could the authors provide the percentage of backend calls for the all tested physical error rate in figure 2 and 5? For example surface d=9 decoded in the range of $ 3 \times 10 {-3}$ to and the backend calls for surface code is only up to .
Follow-up questions from the AC
Thank you for the detailed and diligent responses during the rebuttal period. I have a few additional questions. Given the limited time left, answers without new experiments are sufficient.
1. Positioning
The zero-residual commit gate is conceptually similar to the convergence check in BP+OSD [1, 2]. More broadly, committing or deferring based on the output of a first stage is a natural design in two-stage (pre-/post-) decoders, and well-known decoders such as Belief Matching [3] and the scalable neural decoder of Meinerz et al. [4] already use a two-stage structure in which a first stage informs or reduces the work of a classical decoder. Neural models that guide classical decoders have also been explored, e.g., [4, 5]. Although these methods may not use an explicit commit/defer rule, they are similar in pairing a first-stage (neural) decoder with a classical one. Please clarify what CoD adds beyond these.
2. Comparison with BP+OSD
3. Relay-BP hyperparameters
Hyperparameters of Relay-BP [6], such as the number of legs, iterations per leg, memory strengths, and the stopping criterion, are not reported. Please report them for each code.
4. GNN overhead in FLOPs
If available, please report the additional overhead of the GNN in FLOPs by comparing GNN+BP+OSD with BP+OSD per shot, giving both the average and the worst case.
References
[1] P. Panteleev, G. Kalachev. Degenerate Quantum LDPC Codes With Good Finite Length Performance. Quantum, 2021.
[2] J. Roffe, D. R. White, S. Burton, E. Campbell. Decoding across the quantum low-density parity-check code landscape. Physical Review Research, 2020.
[3] O. Higgott, T. C. Bohdanowicz, A. Kubica, S. T. Flammia, E. T. Campbell. Improved Decoding of Circuit Noise and Fragile Boundaries of Tailored Surface Codes. Physical Review X, 2023.
[4] K. Meinerz, C.-Y. Park, S. Trebst. Scalable Neural Decoder for Topological Surface Codes. Physical Review Letters, 2022.
[5] Y. Peled, D. Zenati, E. Nachmani. Neural Minimum Weight Perfect Matching for Quantum Error Codes. ICML 2026.
[6] T. Müller, T. Alexander, M. E. Beverland, M. Bühler, B. R. Johnson, T. Maurer, D. Vandeth. Improved belief propagation is sufficient for real-time decoding of quantum memory. arXiv, 2025.