When the D‑Wave quantum computer solves a problem, it uses quantum phenomena such as superposition and tunneling to explore all possible solutions simultaneously and find a set of the best ones.
At the end of the computation, a single solution is sampled from a set of good solutions, with some probability, and returned to you as the answer to your problem. Because the sampled solution is probabilistic, different solutions may be returned in different runs. In most cases, when we send a problem to the system, we ask for many samples, not just one. This way, we not only see multiple “best” answers, but also reduce the probability of settling on a suboptimal answer.