Suchergebnisse - "recursive quantum approximate optimization algorithm"
-
1
Modified recursive QAOA for exact MAX-CUT solutions on bipartite graphs: closing the gap beyond QAOA limit
ISSN: 1751-8113, 1751-8121Veröffentlicht: IOP Publishing 28.11.2025Veröffentlicht in Journal of physics. A, Mathematical and theoretical (28.11.2025)“… Quantum approximate optimization algorithm (QAOA) is a quantum–classical hybrid algorithm proposed with the goal of approximately solving combinatorial …”
Volltext
Journal Article -
2
Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs
ISSN: 1573-1332, 1573-1332Veröffentlicht: New York Springer US 26.02.2024Veröffentlicht in Quantum information processing (26.02.2024)“… , at any constant level p . Recently, the recursive quantum approximate optimization algorithm, which is a non-local version of quantum approximate optimization algorithm, has been proposed to overcome these limitations …”
Volltext
Journal Article -
3
Hybrid quantum-classical algorithms for approximate graph coloring
ISSN: 2521-327X, 2521-327XVeröffentlicht: Austria Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften 30.03.2022Veröffentlicht in Quantum (Vienna, Austria) (30.03.2022)“… 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 …”
Volltext
Journal Article -
4
Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 21.02.2023Veröffentlicht in arXiv.org (21.02.2023)“… , at any constant level \(p\). Recently, the recursive quantum approximate optimization algorithm, which is a non-local version of quantum approximate optimization algorithm, has been proposed to overcome these limitations …”
Volltext
Paper -
5
Hybrid quantum-classical algorithms for approximate graph coloring
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 28.03.2022Veröffentlicht in arXiv.org (28.03.2022)“… We show how to apply the recursive quantum approximate optimization algorithm (RQAOA) to MAX-\(k\)-CUT, the problem of finding an approximate …”
Volltext
Paper -
6
Iterative Quantum Algorithms for Maximum Independent Set: A Tale of Low-Depth Quantum Algorithms
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 03.11.2023Veröffentlicht in arXiv.org (03.11.2023)“… We propose and study a new class of hybrid approaches to quantum optimization, termed Iterative Quantum Algorithms, which in particular generalizes the Recursive Quantum Approximate Optimization Algorithm …”
Volltext
Paper