- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies QAOA parameter optimization under a limited measurement budget, addressing how to allocate shots between candidate search and evaluation, and how to reuse effective parameters as circuit depth increases. The proposed BOLT-DA framework divides the budget among original-graph search, reduced-graph search, and candidate selection. It combines branch-specific continuation with interpolation and zero-padding of previously selected parameters, followed by fresh evaluation on the original graph.
Critical strengths
Allocating limited measurements between parameter search and candidate evaluation addresses a meaningful challenge in QAOA optimization. Explicitly accounting for both costs makes the evaluation relevant to settings with restricted measurement budgets.
Critical weaknesses
-
Limited methodological novelty. The framework combines established components: INTERP[1], zero-angle insertion[2], and reduced-graph parameter transfer[3]. Its distinctive separation of branch-specific continuation from selected-solution reuse is not isolated experimentally, leaving the incremental contribution unclear. No direct ablation isolates the benefit of continuing each branch from its own previous output rather than from the previously selected winner.
-
Insufficient evidence for the incremental benefit of the full design. Under matched shot budgets and circuit-batch counts, replacing the reduced-graph branch with a second original-graph search (2ndT) yields significantly higher mean approximation ratios on AIDS and Linux, by 0.42 and 0.48 percentage points, respectively (Table 10). Although BOLT-DA reports lower MSE point estimates and reduced logical gate costs, the evidence does not clearly establish the full design’s incremental value over simpler alternatives.
[1] Zhou, Leo, et al. "Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices." Physical Review X (2020).
[2] Sack, Stefan H., et al. "Recursive greedy initialization of the quantum approximate optimization algorithm with guaranteed improvement." Physical Review A (2023).
[3] Wang, Meng, et al. "Red-qaoa: Efficient variational optimization through circuit reduction." Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems. (2024).
Questions for authors
- Please verify and correct the bibliography: Arrasmith et al. (2021) has an incorrect author list; Pagano et al. (2020) contains two incorrect author names and omits an author; and the DOI for Shaydulin and Wild (2021) points to a different paper. 2. How was Neural QAOA² adapted to the small-graph, finite-shot, and increasing-depth settings? 3. Does removing the guard throughout the entire depth ladder, rather than only reselecting from fixed final-depth pools, materially change performance? 4. Do all results labeled “MG-Net” correspond to the MG-control described in Table 6?