Solving NP-hard optimization problems using Multi-Angle QAOA:
-> Max-Cut Problem
| Graph | Basic QAOA (10 layers) | Multi-Angle QAOA (2-3 layers) |
|---|---|---|
| Chvatal Graph | 0.74502 | 0.92021 |
| Frucht Graph | 0.71875 | 0.86901 |
| Icosahedral Graph | 0.78647 | 0.92798 |
| Petersen Graph | 0.65641 | 0.91862 |
-> Minimum Vertex Cover Problem
| Graph | Basic QAOA (10 layers) | Multi-Angle QAOA (Uni-layer) |
|---|---|---|
| Chvatal Graph | 0.65393 | 0.80505 |
| Frucht Graph | 0.65478 | 0.79064 |
| Icosahedral Graph | 0.70985 | 0.74989 |
| Petersen Graph | 0.52506 | 0.78011 |