| Item type |
SIG Technical Reports(1) |
| 公開日 |
2024-03-21 |
| タイトル |
|
|
タイトル |
Comparison between the performances of General Two-local Ansatzes and QAOA in Max-cut problem |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Comparison between the performances of General Two-local Ansatzes and QAOA in Max-cut problem |
| 言語 |
|
|
言語 |
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 |
| 著者名 |
Xinjian, Yan
Xinwei, Lee
Dongsheng, Cai
Nobuyoshi, Asai
|
| 著者名(英) |
Xinjian, Yan
Xinwei, Lee
Dongsheng, Cai
Nobuyoshi, Asai
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
The Variational Quantum Algorithms (VQAs) are a class of quantum algorithms that use a hybrid approach, combining classical and quantum computing techniques. The classical computers are used as quantum loop optimizers to update the circuit parameters dynamically and find out an approximate solution of complex problems. In this study, we conduct a series of comparative experiments with both two VQAs including Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA) in addressing Max-Cut problems. As a result, the VQE performs better than QAOA in different graphs. Moreover, VQE can only adopt random parameter initialization, while the QAOA has different parameter initialization strategies. Then, we apply the Light Cone Cancellation (LCC) method to VQE and Muti-angle QAOA (Ma-QAOA). Similar to the previous experiments, VQE also performs better than that Ma-QAOA in different graphs. Even within the constraints of the current Noisy Intermediate-Scale Quantum (NISQ) era, we confirm that the LCC can reduce the number of qubits involved in mathematical operations and minimize the resource consumption of quantum circuits. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
The Variational Quantum Algorithms (VQAs) are a class of quantum algorithms that use a hybrid approach, combining classical and quantum computing techniques. The classical computers are used as quantum loop optimizers to update the circuit parameters dynamically and find out an approximate solution of complex problems. In this study, we conduct a series of comparative experiments with both two VQAs including Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA) in addressing Max-Cut problems. As a result, the VQE performs better than QAOA in different graphs. Moreover, VQE can only adopt random parameter initialization, while the QAOA has different parameter initialization strategies. Then, we apply the Light Cone Cancellation (LCC) method to VQE and Muti-angle QAOA (Ma-QAOA). Similar to the previous experiments, VQE also performs better than that Ma-QAOA in different graphs. Even within the constraints of the current Noisy Intermediate-Scale Quantum (NISQ) era, we confirm that the LCC can reduce the number of qubits involved in mathematical operations and minimize the resource consumption of quantum circuits. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AA12894105 |
| 書誌情報 |
研究報告量子ソフトウェア（QS）
巻 2024-QS-11,
号 16,
p. 1-8,
発行日 2024-03-21
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2435-6492 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-QS24011016.pdf (1.5 MB)
