| Item type |
SIG Technical Reports(1) |
| 公開日 |
2023-03-06 |
| タイトル |
|
|
タイトル |
Distributed Coordinate Descent Algorithm for Variational Quantum Classification |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Distributed Coordinate Descent Algorithm for Variational Quantum Classification |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
Department of Computer Science, The University of Tokyo |
| 著者所属 |
|
|
|
IBM Quantum, IBM Japan/Department of Computer Science, The University of Tokyo/Quantum Computing Center, Keio University |
| 著者所属 |
|
|
|
Department of Computer Science, The University of Tokyo |
| 著者所属(英) |
|
|
|
en |
|
|
Department of Computer Science, The University of Tokyo |
| 著者所属(英) |
|
|
|
en |
|
|
IBM Quantum, IBM Japan / Department of Computer Science, The University of Tokyo / Quantum Computing Center, Keio University |
| 著者所属(英) |
|
|
|
en |
|
|
Department of Computer Science, The University of Tokyo |
| 著者名 |
Izuho, Koyasu
Rudy, Raymond
Hiroshi, Imai
|
| 著者名(英) |
Izuho, Koyasu
Rudy, Raymond
Hiroshi, Imai
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Quantum Machine Learning (QML) is one of the hottest areas in near-term quantum computing. Two popular methods in QML are kernel methods and variational methods. Variational methods, which consist of parametrized quantum circuits (PQCs) to encode data and define classifiers, work faster in theory (i.e., O(N) to learn from N training examples) than kernel methods, which use quantum circuits to compute O(N2) elements of kernel matrices. However, in practice when dealing with large N, it is necessary to devise ways to speed up variational methods due to the slow quantum gates. In this work, we propose parallelization of training variational quantum classifiers to utilize the availability of many quantum devices with dozens of qubits. In contrast to existing parallelization of variational methods with gradient-based algorithms, we develop a novel distributed mechanism of coordinate descent algorithm to optimize parametrized gates of variational quantum circuits. There are several gradient-free methods to optimize PQCs that have been shown to converge faster. Here, by focusing on the so-called Free-axis selection (Fraxis) method, we further show how the gradient-free methods can be parallelized, and demonstrate their efficacies by running the algorithm on both simulators and IBM Quantum devices. We confirm the proposed algorithm not only achieves high classification accuracy but also gains speedup that grows linearly with the degree of parallelization. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Quantum Machine Learning (QML) is one of the hottest areas in near-term quantum computing. Two popular methods in QML are kernel methods and variational methods. Variational methods, which consist of parametrized quantum circuits (PQCs) to encode data and define classifiers, work faster in theory (i.e., O(N) to learn from N training examples) than kernel methods, which use quantum circuits to compute O(N2) elements of kernel matrices. However, in practice when dealing with large N, it is necessary to devise ways to speed up variational methods due to the slow quantum gates. In this work, we propose parallelization of training variational quantum classifiers to utilize the availability of many quantum devices with dozens of qubits. In contrast to existing parallelization of variational methods with gradient-based algorithms, we develop a novel distributed mechanism of coordinate descent algorithm to optimize parametrized gates of variational quantum circuits. There are several gradient-free methods to optimize PQCs that have been shown to converge faster. Here, by focusing on the so-called Free-axis selection (Fraxis) method, we further show how the gradient-free methods can be parallelized, and demonstrate their efficacies by running the algorithm on both simulators and IBM Quantum devices. We confirm the proposed algorithm not only achieves high classification accuracy but also gains speedup that grows linearly with the degree of parallelization. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AA12894105 |
| 書誌情報 |
研究報告量子ソフトウェア(QS)
巻 2023-QS-8,
号 16,
p. 1-8,
発行日 2023-03-06
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2435-6492 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |