Constructive synthesis and circuit-depth bounds for exact MIS-QAOA preparation

Construct explicit parameter-synthesis procedures and derive quantitative circuit-depth bounds for preparing an optimal Maximum Independent Set state from the computational vacuum using the standard Flip-or-Void or Flip-or-Stay QAOA architectures.

Background

The paper proves existential finite-depth exact preparation of an optimal MIS state from the computational vacuum for both standard feasibility-preserving mixers. However, the result does not provide an explicit construction of the variational parameters or an upper bound on the required circuit depth. The unresolved problem is therefore to turn the existence guarantee into a constructive synthesis method with quantitative complexity bounds.