The Lie Algebra of XY-mixer Topologies and Warm Starting QAOA for Constrained Optimization
Steven Kordonowy, Hannes Leipold
TL;DR
This work analyzes XY-mixer-based variational quantum algorithms for constrained optimization by explicitly decomposing the dynamical Lie algebras (DLAs) arising from different XY-topologies. It shows that 1D path/ring topologies with $R_Z$ gates yield polynomial-sized DLAs, while all-to-all or $R_{ZZ}$-augmented topologies yield exponentially-large DLAs, and it uses this insight to implement a warm-start strategy: pretrain on a polynomial-DLA circuit and transfer parameters to the full, exponential-DLA circuit. The paper provides detailed DLA decompositions (e.g., $\mathfrak{g}_{XY}^{P}\cong \mathfrak{so}(n)$, $\mathfrak{g}_{XY,Z}^{C}\cong \mathfrak{u}(1)\oplus\mathfrak{su}(n)\oplus\mathfrak{su}(n)$) and conjectures for exponential cases, supported by small-$n$ numerics. It demonstrates the practical payoff by warm-starting QAOA for Portfolio Optimization, Sparsest $k$-Subgraph, and Graph Partitioning, including SP500 benchmarks, where warm-started MA-QAOA delivers dramatic improvements in approximation ratio and success probability over random starts, and outperforms shared-angle variants. The work highlights that structured, symmetry-preserving mixer designs can enable strong performance on NP-hard constrained problems and points to future directions in proving DLA conjectures and extending warm-starting to broader quantum optimization tasks.
Abstract
The XY-mixer has widespread utilization in modern quantum computing, including in variational quantum algorithms, such as Quantum Alternating Operator Ansatz (QAOA). The XY ansatz is particularly useful for solving Cardinality Constrained Optimization tasks, a large class of important NP-hard problems. First, we give explicit decompositions of the dynamical Lie algebras (DLAs) associated with a variety of $XY$-mixer topologies. When these DLAs admit simple Lie algebra decompositions, they are efficiently trainable. An example of this scenario is a ring $XY$-mixer with arbitrary $R_Z$ gates. Conversely, when we allow for all-to-all $XY$-mixers or include $R_{ZZ}$ gates, the DLAs grow exponentially and are no longer efficiently trainable. We provide numerical simulations showcasing these concepts on Portfolio Optimization, Sparsest $k$-Subgraph, and Graph Partitioning problems. These problems correspond to exponentially-large DLAs and we are able to warm-start these optimizations by pre-training on polynomial-sized DLAs by restricting the gate generators. This results in improved convergence to high quality optima of the original task, providing dramatic performance benefits in terms of solution sampling and approximation ratio on optimization tasks for both shared angle and multi-angle QAOA.
