.png){kind=icon}
.png){kind=icon}
Return
Equivariant Quantum Approximate Optimization Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TQE.2026.3654930.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Constructing effective mixer Hamiltonians is essential for enhancing the performance of the quantum approximate optimization algorithm (QAOA) in solving combinatorial optimization problems. In this work, we develop a systematic methodology for designing QAOA mixers that align with the symmetries of the classical objective function, with the goal of achieving values (mean, median, and minimum over multiple runs) that are closer to the true optimum. Our main idea is to design QAOA operators that are explicitly adapted to the action of symmetry groups on the Hilbert space. We focus on subgroups of the symmetric group Sd, where d = 2(l), to ensure compatibility with qudit-based quantum architectures. In particular, we construct QAOA mixers invariant under the full symmetric group Sd as well as its cyclic subgroup Z(d) subset of S-d. These constructions are natural in that they respect the decomposition of the Hilbert space into isotypic components under the symmetry group action. Notably, to the best of the authors' knowledge, the QAOA algorithm based on the Z(d)-invariant mixer provides the first example of a QAOA protocol whose dynamics (up to final measurement) are confined entirely within a nontrivial irreducible representation of a symmetry group of the objective function. Although our work does not investigate the benefits of exploiting such subspaces as computational resources, we think that the very realization of a variational algorithm whose evolution is restricted to a nontrivial symmetry-adapted subspace is of fundamental conceptual interest. We provide closed-form expressions for these mixers, together with explicit quantum circuit implementations. To empirically evaluate our approach, we compare QAOA variants employing the standard mixer B = Sigma X-i with those using our proposed Hamiltonians H-M and H-X on edge coloring and graph partitioning problems. Across multiple graph instances, our symmetry-...
Keywords:
Mixers
Optimization
Approximation algorithms
Partitioning algorithms
Machine learning algorithms
Linear programming
Stationary state
Standards
Quantum circuit
Heuristic algorithms
Mixer Hamiltonians
quantum approximate optimization algorithm
warm-start quantum approximate optimization algorithm (QAOA)
Journal
I
IF:
4.6
Papers:
52
Citations:
0
Organization
View more organizations