Fundamental Limitations of QAOA on Constrained Problems and a Route to Exponential Enhancement

TL;DR

This paper identifies fundamental limitations of standard QAOA on constrained problems and introduces a constraint-enhanced kernel (CE QAOA) that achieves exponential improvements in feasible solution probability.

Contribution

The authors propose a new CE QAOA approach with a specialized kernel that overcomes feasibility bottlenecks and provides exponential enhancement over standard QAOA for permutation constrained problems.

Findings

Standard QAOA faces an intrinsic feasibility bottleneck.

CE QAOA achieves exponential enhancement in feasible solution probability.

The techniques extend to a broad class of NP-hard constrained problems.

Abstract

We study fundamental limitations of the generic Quantum Approximate Optimization Algorithm (QAOA) on constrained problems where valid solutions form a low dimensional manifold inside the Boolean hypercube, and we present a provable route to exponential improvements via constraint embedding. Focusing on permutation constrained objectives, we show that the standard generic QAOA ansatz, with a transverse field mixer and diagonal r local cost, faces an intrinsic feasibility bottleneck: even after angle optimization, circuits whose depth grows at most sublinearly with n cannot raise the total probability mass on the feasible manifold much above the uniform baseline suppressed by the size of the full Hilber space. Against this envelope we introduce a minimal constraint enhanced kernel (CE QAOA) that operates directly inside a product one hot subspace and mixes with a block local XY Hamiltonian. For permutation constrained problems, we prove an angle robust, depth matched exponential enhancement where the ratio between the feasible mass from CE QAOA and generic QAOA grows exponentially in $n^2$ for all depths up to a linear fraction of n, under a mild polynomial growth condition on the interaction hypergraph. Thanks to the problem algorithm co design in the kernel construction, the techniques and guarantees extend beyond permutations to a broad class of NP-Hard constrained optimization problems.