Symmetry-based quantum algorithms for open-shop scheduling with hard constraints
This paper introduces a symmetry-based approach to encode hard constraints in open-shop scheduling problems for quantum computing, proposing a novel variational algorithm that leverages feasibility-preserving permutation groups to guarantee reaching optimal solutions with certainty by optimizing only a quadratic number of parameters.