Symmetry-based QAOA mixers for open-shop scheduling linked to classical permutation groups, plus a new variational algorithm bounding parameters quadratically to reach feasible optima with certainty.
Recall that a graph au- tomorphism is a bijection ϕ : V → V such that ϕ as well as ϕ − 1 preserve adjacency
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Symmetry-based quantum algorithms for open-shop scheduling with hard constraints
Symmetry-based QAOA mixers for open-shop scheduling linked to classical permutation groups, plus a new variational algorithm bounding parameters quadratically to reach feasible optima with certainty.