#

random-maxcut

Here is 1 public repository matching this topic...

animeshnanda1 / Random_maxcut

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

optimization monte-carlo exact-diagonalization qaoa nisq quantum-computation random-maxcut

Updated Sep 9, 2021
Jupyter Notebook

Improve this page

Add a description, image, and links to the random-maxcut topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the random-maxcut topic, visit your repo's landing page and select "manage topics."