- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes a new method for optimizing the DEM in order to improve quantum error correction decoding. The Auto-DEM framework consists of three main components: a decoding graph compiler, PrunerNet and a reinforcement learning strategy. PrunerNet applies physics-guided sparse self-attention over the hyperedges in the DEM. First, the decoding graph is extended, then edges are selected using a sampled binary mask, and finally retained edges are weighted. PrunerNet is trained with reinforce under LER supervision. The proposed method is evaluated on the surface code with $ d = 3, 5, 7 $ over 3 syndrome extraction rounds. The two decoders used for the experiments are MWPM and Correlated Matching. Across both correlated-error and randomly reordered-circuit, relative to fixed topology calibration, the method averagely reduce LER.
Critical strengths
- Optimizing the DEM with Reinforce under LER is a well motivated design choice.
- The extension of the decoding graph followed by pruning and weight estimation is an interesting approach.
Critical weaknesses
- The evaluation is limited to one code family and relative small code sizes. There is no evidence these improvements persist in more relevant settings, for example, surface code with $ d=9, 11....$
- Only one noise level is tested. Without showing results over various noise levels, it is hard to determine whether the improvement is consistent.
Questions for authors
- To better assess the generalization of this method, could the authors provide an additional evaluation on other code families (for example, BB codes)?
- I have concerns regarding the scalability of the proposed method, could the authors provide some evaluation where the number of rounds matches the code distance for d=5 and d=7? Also, can the authors provide an evaluation on larger distance surface codes?
- Since the model was trained with one physical error rate, could the authors provide some clarity regarding its generalization? For example, do the empirical results persist on other noise levels? or does the model need to be retrained for each physical noise level?
3 comments
W1 & Q2. Scalability to larger code distances and longer circuits
We agree that evaluating larger code distances and more realistic measurement rounds is important. We conducted exploratory experiments up to under the standard SI1000 noise model, where Auto-DEM continued to show improvements. However, training costs increase substantially with code distance due to decoding latency per epoch in the RL training pipeline, preventing a systematic evaluation at within our current computational budget.
A major limitation is that LER-based rewards become increasingly difficult to estimate accurately as logical errors become rarer. Improving reward efficiency and training scalability remains an important direction for future research.
To investigate longer measurement sequences, we additionally conducted a cross-round transfer experiment under the correlated-noise setting. We trained a five-layer template graph at , consisting of initialization, repeated-measurement, and final-measurement sections. The repeated-measurement structure is shared across rounds.
Training used 1,500 epochs, with 16 sampled masks and 10k reward shots per epoch. After training, we fixed both the learned topology and edge weights, preserving the two boundary sections while expanding the repeated-measurement section to .
Importantly, no target-round data were used for retraining or weight recalibration. For each round count, all methods shared 10 fresh independent batches of 100k shots.
| Rounds | Standard | PrunerNet | Oracle | LER reduction |
|---|---|---|---|---|
| 5 | 0.0228(3) | 0.0205(4) | 0.0198(3) | 9.85% |
| 7 | 0.0298(7) | 0.0269(5) | 0.0255(6) | 9.85% |
| 9 | 0.0372(8) | 0.0331(6) | 0.0311(8) | 11.09% |
| 11 | 0.0442(5) | 0.0394(4) | 0.0369(3) | 10.88% |
| 13 | 0.0511(6) | 0.0455(7) | 0.0425(6) | 10.92% |
The model trained only at retained its improvement when transferred to without retraining or recalibration. This demonstrates that the learned template can be extended to longer memory circuits under stationary noise.
We will clarify these scalability limitations in the revised manuscript.
W2 & Q3. Generalization across physical error rates
Thank you for raising this important question. Our additional experiments show that retraining is not required for every physical error rate within the tested range.
For each noise setting, we evaluated one PrunerNet model trained at , with , and fixed both its graph structure and all edge weights. Without any retraining or recalibration, we evaluated it at five physical error rates, .
For each , we generated 10 independent batches of 100k fresh test shots, shared by all methods. The random-ordering schedule was unchanged, while the correlated-noise strength followed the original setting .
For comparison, Parity used an additional 200k shots at each to recalibrate the Standard DEM, whereas PrunerNet used no data from the new error rates. LERs are reported as mean(sample standard deviation) across the ten batches, with ddof=1; means have four decimal places, and parenthetical digits refer to the last decimal place.
Random ordering
| Parity | PrunerNet | Oracle | |
|---|---|---|---|
| 0.0015 | 0.0023(2) | 0.0017(1) | 0.0012(1) |
| 0.0020 | 0.0045(2) | 0.0035(2) | 0.0027(1) |
| 0.0030 | 0.0113(2) | 0.0099(2) | 0.0080(4) |
| 0.0040 | 0.0225(4) | 0.0207(6) | 0.0178(5) |
| 0.0050 | 0.0383(7) | 0.0364(8) | 0.0326(6) |
Correlated noise
| Parity | PrunerNet | Oracle | |
|---|---|---|---|
| 0.0015 | 0.0032(2) | 0.0028(1) | 0.0026(2) |
| 0.0020 | 0.0059(1) | 0.0054(1) | 0.0052(1) |
| 0.0030 | 0.0151(4) | 0.0138(3) | 0.0138(5) |
| 0.0040 | 0.0288(5) | 0.0272(4) | 0.0272(5) |
| 0.0050 | 0.0474(6) | 0.0455(7) | 0.0456(8) |
At all five error rates, the fixed PrunerNet DEMs outperform Parity recalibrated at each .
These results demonstrate that Auto-DEM can retain its decoding advantage across a range of physical error rates without retraining or weight recalibration, despite being trained only at .
We will include these results and clarify the scope of this generalization in the revised manuscript.
Thank you for the additional experiments and detailed responses. The results are encouraging, and I believe the method has potential. However, my main concern still remains, I think the method is still limited in terms of scalability, and the complexity of the architecture is not well justified. Therefore, I will maintain my original score.
We thank the reviewer for the constructive feedback. We conducted additional experiments on BB codes, longer surface-code circuits, and generalization across physical error rates. We address these concerns in three comments.
W1 & Q1. Generalization to other code families: BB codes
Following your suggestion, we evaluated Auto-DEM on the [[144,12,12]] BB code (Gross Code) with r=3, using BP+OSD-0 and BP+OSD-CS4 to decode LER. The code construction and CNOT schedule follow https://www.nature.com/articles/s41586-024-07107-7, with ℓ=12,m=6, A=x3+y+y2, and B=y3+x+x2.
Unlike our surface code experiments, we extended the DEM with higher-order hyperedges (Manhattan threshold 3, orders = [2, 3, 4]). This introduced 5,459 candidate mechanisms beyond the original 14,616 mechanisms (3960 basic, 10656 non-basic). Under SI1000 noise (p=0.003), we used 200k training shots and 100k validation shots. Training consisted of 1,500 iterations, each evaluating 8 candidate graphs on 5k shared shots. The reward was the mean LER across all 12 logical observables.
After training, we evaluated all methods on 10 independent batches of 100k shots. We compared the circuit-compiled Ground truth DEM, the original circuit graph structure + Parity (Nominal parity), the full extended graph + Parity (Full parity), and PrunerNet + Parity. We also tested the learned DEM on BP+OSD-CS4 to assess whether it had overfit to the BP+OSD-0. LER results are reported as mean(std):
Compared with the circuit-compiled Ground Truth DEM, Auto-DEM reduced mean LER by 39.56% with BP+OSD-0 and 34.22% with BP+OSD-CS4. All 12 logical observables showed improvements under both decoders. Interestingly, the improvement persists when switching from BP+OSD-0 to BP+OSD-CS4 without retraining. This suggests that the learned topology can benefit different decoding configurations.
We also measured graph complexity and decoding time. The following mean decoding times were measured on 10 independent datasets of 100k shots on a single RTX 4090:
Compared with Ground Truth, Auto-DEM reduced decoding time by 45.36% and 42.14%, respectively. These results provide evidence that Auto-DEM can generalize beyond surface codes and matching decoders. In particular, topology optimization can improve both accuracy and efficiency for approximate decoders such as BP-OSD. We thank the reviewer for suggesting this valuable extension.