The Lie Algebra of XY-mixer Topologies and Warm Starting QAOA for Constrained Optimization
Steven Kordonowy, Hannes Leipold

TL;DR
This paper analyzes the Lie algebra structures of XY-mixer topologies in QAOA, identifying when they are efficiently trainable and demonstrating warm-start strategies for complex constrained optimization problems.
Contribution
It provides explicit decompositions of dynamical Lie algebras for various XY-mixer topologies and introduces warm-start methods for large-scale problems.
Findings
Efficient trainability when DLAs admit simple Lie algebra decompositions.
Warm-start pre-training improves convergence and solution quality.
Numerical simulations on portfolio optimization and graph problems show performance gains.
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 -mixer topologies. When these DLAs admit simple Lie algebra decompositions, they are efficiently trainable. An example of this scenario is a ring -mixer with arbitrary gates. Conversely, when we allow for all-to-all -mixers or include gates, the DLAs grow exponentially and are no longer efficiently trainable. We provide numerical simulations showcasing these concepts on Portfolio Optimization, Sparsest -Subgraph, and Graph Partitioning problems. These…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
