Výsledky vyhledávání - "Recursive quantum approximate optimization algorithms"

  • Zobrazuji výsledky 1 - 6 z 6
Upřesnit hledání
  1. 1

    Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs Autor Bae, Eunok, Lee, Soojoon

    ISSN: 1573-1332, 1573-1332
    Vydáno: New York Springer US 26.02.2024
    Vydáno v 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…”
    Získat plný text
    Journal Article
  2. 2

    Modified recursive QAOA for exact MAX-CUT solutions on bipartite graphs: closing the gap beyond QAOA limit Autor Bae, Eunok, Kwon, Hyukjoon, Vijendran, V, Lee, Soojoon

    ISSN: 1751-8113, 1751-8121
    Vydáno: IOP Publishing 28.11.2025
    “…Quantum approximate optimization algorithm (QAOA) is a quantum–classical hybrid algorithm proposed with the goal of approximately solving combinatorial…”
    Získat plný text
    Journal Article
  3. 3

    Hybrid quantum-classical algorithms for approximate graph coloring Autor Bravyi, Sergey, Kliesch, Alexander, Koenig, Robert, Tang, Eugene

    ISSN: 2521-327X, 2521-327X
    Vydáno: Austria Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften 30.03.2022
    Vydáno v 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…”
    Získat plný text
    Journal Article
  4. 4

    Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs Autor Bae, Eunok, Lee, Soojoon

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 21.02.2023
    Vydáno v 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…”
    Získat plný text
    Paper
  5. 5

    Hybrid quantum-classical algorithms for approximate graph coloring Autor Bravyi, Sergey, Kliesch, Alexander, Koenig, Robert, Tang, Eugene

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 28.03.2022
    Vydáno v 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…”
    Získat plný text
    Paper
  6. 6

    Iterative Quantum Algorithms for Maximum Independent Set: A Tale of Low-Depth Quantum Algorithms Autor Brady, Lucas T, Hadfield, Stuart

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 03.11.2023
    Vydáno v 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…”
    Získat plný text
    Paper