How quantum annealing sustains combinatorial problem-solving
The difficulty of combinatorial optimisation has long challenged computer scientists and applied mathematicians alike. Problems such as the travelling sales person issue, chart colouring, and Boolean satisfiability are approved examples of jobs where classic solvers battle as trouble size rises.