Combinatorial optimisation troubles are notoriously difficult. The number of feasible services expands tremendously with trouble size, and also small circumstances can defeat exhaustive classical search within any reasonable amount of time. Quantum annealing computers resolve this challenge with