  We assess the performance of D-wave quantum solvers for solving the stable
set problem in a graph, one of the most studied NP-hard problems. We perform
computations on some instances from the literature with up to 125 vertices and
compare the quality of the obtained solutions with known optimum solutions. It
turns out that the hybrid solver gives very good results, while the Quantum
Processing Unit solver shows rather modest performance overall.
