Local classical MAX-CUT algorithm outperforms $p=2$ QAOA on high-girth regular graphs
The $p$-stage Quantum Approximate Optimization Algorithm (QAOA$_p$) is a promising approach for combinatorial optimization on noisy intermediate-scale quantum (NISQ) devices, but its theoretical behavior is not well understood beyond $p=1$. We analyze QAOA$_2$ for the $\textit{maximum cut problem}$...
में बचाया:
| मुख्य लेखक: | |
|---|---|
| स्वरूप: | Artigo |
| भाषा: | Inglês |
| प्रकाशित: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2021-04-01
|
| श्रृंखला: | Quantum |
| ऑनलाइन पहुंच: | https://quantum-journal.org/papers/q-2021-04-20-437/pdf/ |
| टैग: |
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|