- Rating
- 1
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper studies the stability and computational cost of quantum natural gradient (QNG) optimization for variational quantum algorithms. Its main contributions are a geodesic smoothness analysis with convergence guarantees, a characterization of noise-induced instability caused by the metric shrinking faster than the gradient, and DFS-QNG, a method that updates mutually commuting parameter blocks using smaller metric matrices. Under the stated assumptions, these block updates follow exact geodesics within their restricted submanifolds. Validation consists of VQE and QAOA experiments on 4–10 qubits, covering noiseless and depolarizing-noise settings with five runs per configuration. The reported results show improved optimization stability and lower cumulative energy error compared with standard QNG and Adam. The method reduces metric computation but does not eliminate the underlying noise-induced instability
Critical strengths
The manuscript investigates Riemannian optimization for variational quantum algorithms in both ideal and noisy settings, addressing a conceptually interesting question: how the geometry of the quantum state manifold affects optimization when noise suppresses both gradients and the metric. Its attempt to connect geometric smoothness, noise-induced behavior, and convergence guarantees is a strength. The proposed DFS-QNG framework is also potentially useful: by organizing updates into smaller parameter blocks with commuting generators, it seeks to reduce the cost of metric estimation and inversion while retaining some geometric information. This provides a concrete algorithmic direction beyond the theoretical analysis. However, the significance of these contributions depends on the validity of the convergence arguments and on whether the computational savings translate into improved performance once measurement costs and the effects of blockwise updates are accounted for.
Critical weaknesses
A substantive mathematical error undermines the proof of Theorem 2(i). Immediately below Equation (37), the authors use in the regime , although this assumption does not justify the claimed upper bound. If , then , directly contradicting that estimate. Consequently, bounding the inverse regularized metric by does not establish the asserted scaling. More generally, an upper bound on the metric’s largest eigenvalue cannot provide the lower bound on its smallest eigenvalue needed to control the inverse. This is consequential because the argument for bounded Levi–Civita connection coefficients relies on such inverse-metric control. It is therefore a gap in the proof rather than a typographical error. Repair would require an appropriate spectral lower bound, together with the corresponding derivative estimates, or a different argument. Until this is supplied, the claimed geometric stability in Theorem 2(i) remains unestablished.
Questions for authors
Do you have an alternative proof of Theorem 2(i)?
Discussion?
Dear authors,
if you want to engage in a discussion, the time is now. The forum will close to the authors on November 18, 2026: https://iclr.cc/Conferences/2027/Dates
Without a rebuttal, there the reviewers are unlikely to change their opinion, which would lead to rejection, most likely.
Sincerely Your AC