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 linearly 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.

翻译：我们研究了通用量子近似优化算法（QAOA）在约束问题上的基本局限性——其中有效解构成布尔超立方体内的低维流形，并提出了一种通过约束嵌入实现指数级改进的可证路径。针对排列约束型目标函数，我们证明标准通用QAOA框架（采用横向场混合器与对角r局域代价函数）存在固有效可行性瓶颈：即使经过角度优化，深度最多随n线性增长的电路也无法将可行流形上的总概率质量提升至接近由完整希尔伯特空间尺度压制的均匀基线之上。针对这一瓶颈，我们引入最小约束增强核（CE-QAOA），该算法直接在一热子空间的乘积空间内运作，并采用块局域XY哈密顿量进行混合。对于排列约束问题，我们证明在相互作用超图满足温和多项式增长条件下，对于不超过n线性比例的任意深度，CE-QAOA与通用QAOA可行质量比随$n^2$呈指数增长，且该增强具有角度鲁棒性与深度匹配特性。得益于核构造中的问题-算法协同设计，该技术及其保证可超越排列约束，推广至一类广泛的NP难约束优化问题。