A Study on the Leapfrogging Strategy for the Quantum Approximate Optimization Algorithm on n-regular Graph Instances

• Item type: National Convention(1)
• 公開日: 2021-03-04
• タイトル: A Study on the Leapfrogging Strategy for the Quantum Approximate Optimization Algorithm on n-regular Graph Instances
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: ソフトウェア科学・工学
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_5794
• 資源タイプ: conference paper
• 著者所属: 筑波大
• 著者名: Xinwei, Lee
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: The quantum approximate optimization algorithm (QAOA) has numerous promising applications on solving the combinatorial optimization problems on the near-term Noisy Intermediate Scalable Quantum (NISQ) devices. QAOA has a quantum-classical hybrid structure, with the quantum part consisting the parameterized alternating operator ansatz, and the classical part consist of an optimization algorithm optimizing the parameters to maximize the expectation value. This value depends highly on the parameters. This implies that a set of good parameters leads to an accurate solution of the given problem. However, at large circuit depth, it is difficult to achieve global optimization due to the multiple occurrence of local minima. Therefore, we study the so-called leapfrogging strategy on solving the Max-cut problem for 3-regular graphs, which reuses the optimized parameters in larger graphs.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00349328
• 書誌情報: 第83回全国大会講演論文集; 巻 2021, 号 1, p. 155-156, 発行日 2021-03-04
• 出版者 / 言語: ja
• 出版者: 情報処理学会