| Item type |
SIG Technical Reports(1) |
| 公開日 |
2022-03-17 |
| タイトル |
|
|
タイトル |
Transferring Optimal QAOA Parameters Between Regular Graphs for Larger Circuit Depth |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Transferring Optimal QAOA Parameters Between Regular Graphs for Larger Circuit Depth |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
University of Tsukuba |
| 著者所属 |
|
|
|
University of Tsukuba |
| 著者所属 |
|
|
|
University of Tsukuba |
| 著者所属 |
|
|
|
University of Aizu |
| 著者所属(英) |
|
|
|
en |
|
|
University of Tsukuba |
| 著者所属(英) |
|
|
|
en |
|
|
University of Tsukuba |
| 著者所属(英) |
|
|
|
en |
|
|
University of Tsukuba |
| 著者所属(英) |
|
|
|
en |
|
|
University of Aizu |
| 著者名 |
Ningyi, Xie
Xinwei, Lee
Dongsheng, Cai
Nobuyoshi, Asai
|
| 著者名(英) |
Ningyi, Xie
Xinwei, Lee
Dongsheng, Cai
Nobuyoshi, Asai
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
The Quantum approximate optimization algorithm (QAOA) is a quantum algorithm that aims to produce approximate solutions for combinatorial optimization problems. The quantum circuit parameters of QAOA are optimized to find the optimal solution. Recent research found that, for the Max-cut problem, the optimal parameters of the QAOA circuit for one graph with small number of nodes can be used for another graph with larger number of nodes if their degrees have the same parity. In this paper, we come up with the conjecture of the condition of parameter transfer for larger circuit Depth QAOA, and numerically verify it for regular graphs. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
The Quantum approximate optimization algorithm (QAOA) is a quantum algorithm that aims to produce approximate solutions for combinatorial optimization problems. The quantum circuit parameters of QAOA are optimized to find the optimal solution. Recent research found that, for the Max-cut problem, the optimal parameters of the QAOA circuit for one graph with small number of nodes can be used for another graph with larger number of nodes if their degrees have the same parity. In this paper, we come up with the conjecture of the condition of parameter transfer for larger circuit Depth QAOA, and numerically verify it for regular graphs. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AA12894105 |
| 書誌情報 |
量子ソフトウェア（QS）
巻 2022-QS-5,
号 7,
p. 1-6,
発行日 2022-03-17
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2435-6492 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-QS22005007.pdf (1.4 MB)
