Simulations of the adiabatic quantum optimization for the Set Partition Problem.

We analyze the complexity of the quantum optimization algorithm based on adiabatic evolution for the NP-complete set partition problem. We introduce a cost function defined on a logarithmic scale of the partition residues so that the total number of values of the cost function is of the order of the problem size. We simulate the behavior of the algorithm by numerical solution of the time