ログイン 新規登録
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 研究報告
  2. 量子ソフトウェア(QS)
  3. 2023
  4. 2023-QS-008

Distributed Coordinate Descent Algorithm for Variational Quantum Classification

https://ipsj.ixsq.nii.ac.jp/records/225050
https://ipsj.ixsq.nii.ac.jp/records/225050
b177d880-8118-4766-b572-b8b3844d69c5
名前 / ファイル ライセンス アクション
IPSJ-QS23008016.pdf IPSJ-QS23008016.pdf (1.5 MB)
Copyright (c) 2023 by the Information Processing Society of Japan
オープンアクセス
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

× Izuho, Koyasu

Izuho, Koyasu

Search repository
Rudy, Raymond

× Rudy, Raymond

Rudy, Raymond

Search repository
Hiroshi, Imai

× Hiroshi, Imai

Hiroshi, Imai

Search repository
著者名(英) Izuho, Koyasu

× Izuho, Koyasu

en Izuho, Koyasu

Search repository
Rudy, Raymond

× Rudy, Raymond

en Rudy, Raymond

Search repository
Hiroshi, Imai

× Hiroshi, Imai

en Hiroshi, Imai

Search repository
論文抄録
内容記述タイプ 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
出版者 情報処理学会
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-19 12:56:40.939989
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3