- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper focus on Progressive depth training for VQE. The authors point out that a new hardware-efficient block brings a CNOT ring that cannot be switched off, so every expansion scrambles what the optimizer just found. Their fix appends a block and its reverse, so the two rings land next to each other and cancel. That cancellation is angle-independent, so the effective circuit is one fixed CNOT ring plus a stack of local rotations. They then prove this family's reachable set stops growing at depth two, and report that training still improves afterwards.
Critical strengths
- Because the reachable set saturates, a depth-5 single-entangler circuit trained from scratch sees exactly the same states as IP-PDT, and comparing the two at matched step budgets separates optimization from expressibility. Most work in this area compares ansätze of different expressive power and therefore cannot attribute anything; this control appears do it well. The saturation theorem itself is also correct.
Critical weaknesses
-
Theorem 4.7 needs φ* ≠ 0 (Remark B.2 says the homotopy is trivial at φ = 0) and Theorem 4.12 needs ‖φ*‖ = O(σ) with σ > 0. But Figure 17 shows σ = 0 matching σ = 0.05, zero initialisation matching both, and Section 5.12 concludes the jitter is not what drives anything. So the mechanism the theorems analyse is not the mechanism at work. What remains unconditional is Theorem 4.9, which is bookkeeping: accept an improvement, otherwise fall back, so the energy cannot rise. Its content is the exact fallback, and that is worth having, but it is not an explanation. The paper's central question: why does training keep helping once the manifold has stopped growing, is left unanswered by Section 4.
-
Assumption 4.11 wants a Hessian bounded below by µ_D > 0. For this circuit that is impossible. By Lemma 4.1 a depth-D ≥ 2 state is (⊗V_q)·U·(⊗r_q)|0>. Fix any parameter point and any r'. Set V' = V·U·r·r'⁻¹·U⁻¹. Then V'·U·r'|0> = V·U·r|0>, the same state. Since the post-entangler layers reach all of SU(2)^⊗n, this is a 3n-parameter family of parameter vectors preparing one state. The energy is constant along it, so the second derivative vanishes in those directions and the Hessian has at least 3n zero eigenvalues everywhere. Hence µ_D = 0, always; at depth 1 the same argument gives n. Assumptions 4.6 and 4.11 both fail, Theorem 4.7's Jacobian is singular, and Theorem 4.12's contraction factor is undefined. What makes this awkward is that the redundancy causing it is exactly what Theorem 4.2 proves. The repair is to put the regularity on the quotient by the fibres, or to require a nondegenerate minimum on the reachable manifold itself.
Questions for authors
-
Is it true that ∇²E_D has at least 3n zero eigenvalues everywhere for D ≥ 2? If so, how do Assumptions 4.6 and 4.11 get restated so that Theorems 4.7 and 4.12 are not vacuous?
-
If σ = 0 performs as well as σ = 0.05, which result do you intend as the explanation of the gains?
-
Are the Table 5 / 6 / 7 differences separate measurement streams or errors, and which initialisation produced the reported numbers?