Hybrid quantum-classical algorithms for approximate graph coloring
We show how to apply the recursive quantum approximate optimization algorithm (RQAOA) to MAX-$k$-CUT, the problem of finding an approximate $k$-vertex coloring of a graph. We compare this proposal to the best known classical and hybrid classical-quantum algorithms. First, we show that the standard (...
में बचाया:
| मुख्य लेखकों: | , , , |
|---|---|
| स्वरूप: | Artigo |
| भाषा: | Inglês |
| प्रकाशित: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2022-03-01
|
| श्रृंखला: | Quantum |
| ऑनलाइन पहुंच: | https://quantum-journal.org/papers/q-2022-03-30-678/pdf/ |
| टैग: |
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|