Finite-Depth, Finite-Shot Guarantees for Constrained Quantum Optimization via Fej\'er Filtering
Abstract
We study finite-layer alternations of the Constraint--Enhanced Quantum Approximate Optimization Algorithm (CE--QAOA), a constraint-aware ansatz that operates natively on block one-hot manifolds. Our focus is on feasibility and optimality guarantees. We show that restricting cost angles to a harmonic lattice exposes a positive Fej\'er filter acting on the cost-phase unitary UC(γ)=e-iγ HC in a cost-dephased reference model (used only for analysis). Under a wrapped phase-separation condition, this yields dimension-free finite-depth and finite-shot lower bounds on the success probability of sampling an optimal solution. In particular, we obtain a ratio-form guarantee \[ q0 \;\; x1+x, x \;=\; (p+1)2 2(δ/2)\,Cβ, \] where q0 is the single-shot success probability, Cβ is the mixer-envelope mass on the optimal set, δ is a phase-gap proxy, and p is the number of layers. A Coherent equivalent is proved subsequently and a Riemann--Lebesgue averaging extends the discussion beyond exact lattice normalization. We conclude by outlining coherent realizations of near-term-hardware-efficient positive spectral filters as a main open direction for this framework.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.