The role of quantum annealing in dealing with combinatorial problems
The trouble of combinatorial optimization has actually long challenged computer scientists and used mathematicians alike. Troubles such as the taking a trip sales person trouble, graph colouring, and Boolean satisfiability are canonical examples of jobs where classical solvers struggle as trouble