Klasy problemów optymalizacji binarnej odpowiednie i nieodpowiednie dla heurystyk kwantowych.

The talk considers the problem of finding applications of NISQ hardware and beyond, in the realm of quadratic unconstrained binary optimization. Some potential properties of potential problem candidates will be discussed. Particular experience with certain problem classes, originating from code theory (c.f. Mathematics 2025, 13(16), 2633), nonclassical correlations, and railways will be presented as an illustration.