Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs (Q6129148)
From MaRDI portal
scientific article; zbMATH DE number 7833240
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs |
scientific article; zbMATH DE number 7833240 |
Statements
Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs (English)
0 references
16 April 2024
0 references
recursive quantum approximate optimization algorithms
0 references
MAX-CUT problem
0 references
complete graphs
0 references
