WEKO3
アイテム
Robust Angle Finding for Generalized Quantum Signal Processing
https://ipsj.ixsq.nii.ac.jp/records/235050
https://ipsj.ixsq.nii.ac.jp/records/235050e784ef2b-2c1e-4c81-b897-e1573cf590bd
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
|
2026年6月20日からダウンロード可能です。
|
Copyright (c) 2024 by the Information Processing Society of Japan
|
|
| 非会員:¥660, IPSJ:学会員:¥330, QS:会員:¥0, DLIB:会員:¥0 | ||
| Item type | SIG Technical Reports(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2024-06-20 | |||||||||
| タイトル | ||||||||||
| タイトル | Robust Angle Finding for Generalized Quantum Signal Processing | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | Robust Angle Finding for Generalized Quantum Signal Processing | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_18gh | |||||||||
| 資源タイプ | technical report | |||||||||
| 著者所属 | ||||||||||
| Department of Applied Physics, University of Tokyo | ||||||||||
| 著者所属 | ||||||||||
| Department of Applied Physics, University of Tokyo | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Department of Applied Physics, University of Tokyo | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Department of Applied Physics, University of Tokyo | ||||||||||
| 著者名 |
Shuntaro, Yamamoto
× Shuntaro, Yamamoto
× Nobuyuki, Yoshioka
|
|||||||||
| 著者名(英) |
Shuntaro, Yamamoto
× Shuntaro, Yamamoto
× Nobuyuki, Yoshioka
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Quantum Signal Processing (QSP), together with the quantum singular value transformation, is one of the central quantum algorithms due to its efficiency and generality in many fields including quantum simulation, quantum machine learning, and quantum cryptography. The largest bottleneck of QSP and its family is its difficulty in finding the phase angle sequence for signal processing. We find that this is in particular prominent when one employs the generalized QSP (GQSP) to employ arbitrary single-qubit unitaries for signal processing operator. In this work, we extend the framework of GQSP and propose a robust angle finding algorithm. The proposed angle finding algorithm, based on Prony's method, successfully generates angle sequence of precision 10-13 up to polynomial degrees of hundreds within a second. By applying our method to Hamiltonian simulation, we find that the number of calls, or queries, to signal operators are essentially halved compared to the ordinary framework of QSP. | |||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Quantum Signal Processing (QSP), together with the quantum singular value transformation, is one of the central quantum algorithms due to its efficiency and generality in many fields including quantum simulation, quantum machine learning, and quantum cryptography. The largest bottleneck of QSP and its family is its difficulty in finding the phase angle sequence for signal processing. We find that this is in particular prominent when one employs the generalized QSP (GQSP) to employ arbitrary single-qubit unitaries for signal processing operator. In this work, we extend the framework of GQSP and propose a robust angle finding algorithm. The proposed angle finding algorithm, based on Prony's method, successfully generates angle sequence of precision 10-13 up to polynomial degrees of hundreds within a second. By applying our method to Hamiltonian simulation, we find that the number of calls, or queries, to signal operators are essentially halved compared to the ordinary framework of QSP. | |||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AA12894105 | |||||||||
| 書誌情報 |
研究報告量子ソフトウェア(QS) 巻 2024-QS-12, 号 3, p. 1-17, 発行日 2024-06-20 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 2435-6492 | |||||||||
| Notice | ||||||||||
| SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. | ||||||||||
| 出版者 | ||||||||||
| 言語 | ja | |||||||||
| 出版者 | 情報処理学会 | |||||||||