There is an increasing interest in quantum algorithms for problems of integer programming and combinatorial optimization. Classical solvers such employ relaxations, which replace binary variables with continuous ones, instance the form higher-dimensional matrix-valued (semidefinite programming). Under Unique Games Conjecture, these relaxations often provide best performance ratios available cla...