animeshnanda1/Random_maxcut
The max-cut problem on a random graph with 7 nodes is solved using QAOA, ED, Monte-Carlo, and simulated annealing.
Jupyter Notebook
The max-cut problem on a random graph with 7 nodes is solved using QAOA, ED, Monte-Carlo, and simulated annealing.
Jupyter Notebook