Random_maxcut

Here we will compare between two well known methods (ED & MCMC) and a new method (QAOA) to solve the max-cut problem on a random graph.

The comparison between QAOA and ED is summerized in this notebook, while the monte-carlo result is summerized in a separate notebook. And finally, we will solve the problem using simulated annealing in this notebook.