What quantum annealing offers combinatorial computational problems
The problem of combinatorial optimisation has long tested computer researchers and used mathematicians alike. Issues such as the taking a trip salesperson problem, graph colouring, and Boolean satisfiability are canonical examples of jobs where classical solvers struggle as trouble size increases