Optimization and Quantum Annealing
Anjan Kumar Chandra, Bikas K. Chakrabarti · Texts and readings in physical sciences · 2011
Optimization deals with problem of finding the minimum of a given cost function (the relationship between the total cost of production and the quantity of a product produced) and in the combinatorial optimisation problems the cost function depends on a large number of variables and hard problems are those for which the computational time is not bound by any polynomial in the problem size [1]. To solve hard optimization problems is a challenging task. Several techniques have been developed to get to the solution(s) of such problems. Here we will discuss about some of the problems and also the techniques that have already been implemented.