- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper introduces LiftDiff, a guided discrete diffusion framework for constructing quantum LDPC codes by generating classical base matrices and lifting them into quantum codes. The method uses energy-based guidance to optimise desirable code properties, discovering several competitive codes with favourable rate–distance trade-offs and logical error performance.
Critical strengths
Interesting framework: The combination of discrete diffusion, energy-based guidance, and lifted-product constructions provides a promising approach to automated quantum code discovery.
New code constructions: The method discovers several competitive codes and demonstrates encouraging decoding performance under code-capacity and circuit-level noise.
Critical weaknesses
Limited discussion of related work: The literature review could better contextualise the contribution relative to earlier frameworks for constructing quantum codes from classical codes, particularly Roffe et al. (1804.07653) and the broader graphical framework of Chancellor et al. (1804.07653). While these works use different constructions, they also explore systematic quantum code design from classical structures, and a clearer discussion would help distinguish the proposed framework's novelty.
Limited methodological comparisons: Although the paper compares the resulting codes against existing constructions and studies guided versus unguided diffusion, it lacks a systematic comparison with alternative search or optimization methods under comparable computational budgets, making it difficult to isolate the benefits of diffusion itself.
Questions for authors
- Could the authors address the two points raised in the weaknesses (i.e. discussion of related work and role of diffusion)?
- Are there any interesting applications to early small scale noisy quantum architectures, where the methods provides a principles framework to work around the constraints of such architectures?
Thank you for conducting the additional experiments. The schedule and the zero-failure point presented in Figure 4 are now clear, and the decoding ablation provides valuable insight.
My primary concern is that the new baselines do not include the settings that produced [[247,19,14]] and [[260,24,10]]. For these two settings, how frequently does each method achieve the same distance and check-weight targets across different seeds, given a comparable search budget? I also recommend softening the abstract’s claim regarding outperforming Gross, considering the mixed results at the circuit level. I will maintain my score at 2 for now.