Symmetry reductions in QAOA for MaxCut can collapse DLA dimensions from exponential to quadratic depending on the fixed variable, with graph embeddings ensuring expressivity and improved trainability.
Title resolution pending
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 3
citation-polarity summary
fields
quant-ph 5roles
background 3polarities
background 3representative citing papers
Hybrid quantum walks with optimal dynamical coin operators outperform QAOA on Max-Cut and MIS by accessing a strictly larger Jordan-Lie algebra that enables faster convergence and higher accuracy.
The paper decomposes dynamical Lie algebras of XY-mixer topologies and demonstrates warm-starting QAOA via pre-training on restricted generators to improve convergence on constrained optimization problems.
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
citing papers explorer
-
Reductions of QAOA Induced by Classical Symmetries: Theoretical Insights and Practical Implications
Symmetry reductions in QAOA for MaxCut can collapse DLA dimensions from exponential to quadratic depending on the fixed variable, with graph embeddings ensuring expressivity and improved trainability.
-
Beyond Single Trajectories: Optimal Control and Jordan-Lie Algebra in Hybrid Quantum Walks for Combinatorial Optimization
Hybrid quantum walks with optimal dynamical coin operators outperform QAOA on Max-Cut and MIS by accessing a strictly larger Jordan-Lie algebra that enables faster convergence and higher accuracy.
-
The Lie Algebra of XY-mixer Topologies and Warm Starting QAOA for Constrained Optimization
The paper decomposes dynamical Lie algebras of XY-mixer topologies and demonstrates warm-starting QAOA via pre-training on restricted generators to improve convergence on constrained optimization problems.
-
Bridging Krylov Complexity and Universal Analog Quantum Simulator
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
- Enabling Lie-Algebraic Classical Simulation beyond Free Fermions