ログイン 新規登録
言語:

WEKO3

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

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

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

Quantum Gate Pattern Recognition and Circuit Optimization for Scientific Applications

https://ipsj.ixsq.nii.ac.jp/records/210561
https://ipsj.ixsq.nii.ac.jp/records/210561
ca8d1a81-80e7-4956-a963-78dd19788f4a
名前 / ファイル ライセンス アクション
IPSJ-QS21002014.pdf IPSJ-QS21002014.pdf (1.4 MB)
Copyright (c) 2021 by the Information Processing Society of Japan
オープンアクセス
Item type SIG Technical Reports(1)
公開日 2021-03-22
タイトル
タイトル Quantum Gate Pattern Recognition and Circuit Optimization for Scientific Applications
タイトル
言語 en
タイトル Quantum Gate Pattern Recognition and Circuit Optimization for Scientific Applications
言語
言語 eng
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_18gh
資源タイプ technical report
著者所属
Department of Physics, The University of Tokyo
著者所属
International Center for Elementary Particle Physics (ICEPP), The University of Tokyo
著者所属
International Center for Elementary Particle Physics (ICEPP), The University of Tokyo
著者所属
Physics Division, Lawrence Berkeley National Laboratory
著者所属
Physics Division, Lawrence Berkeley National Laboratory
著者所属
International Center for Elementary Particle Physics (ICEPP), The University of Tokyo
著者所属
International Center for Elementary Particle Physics (ICEPP), The University of Tokyo
著者所属
Department of Physics, The University of Tokyo
著者所属
International Center for Elementary Particle Physics (ICEPP), The University of Tokyo
著者所属
International Center for Elementary Particle Physics (ICEPP), The University of Tokyo
著者所属(英)
en
Department of Physics, The University of Tokyo
著者所属(英)
en
International Center for Elementary Particle Physics (ICEPP), The University of Tokyo
著者所属(英)
en
International Center for Elementary Particle Physics (ICEPP), The University of Tokyo
著者所属(英)
en
Physics Division, Lawrence Berkeley National Laboratory
著者所属(英)
en
Physics Division, Lawrence Berkeley National Laboratory
著者所属(英)
en
International Center for Elementary Particle Physics (ICEPP), The University of Tokyo
著者所属(英)
en
International Center for Elementary Particle Physics (ICEPP), The University of Tokyo
著者所属(英)
en
Department of Physics, The University of Tokyo
著者所属(英)
en
International Center for Elementary Particle Physics (ICEPP), The University of Tokyo
著者所属(英)
en
International Center for Elementary Particle Physics (ICEPP), The University of Tokyo
著者名 Wonho, Jang

× Wonho, Jang

Wonho, Jang

Search repository
Koji, Terashi

× Koji, Terashi

Koji, Terashi

Search repository
Masahiko, Saito

× Masahiko, Saito

Masahiko, Saito

Search repository
Christian, W. Bauer

× Christian, W. Bauer

Christian, W. Bauer

Search repository
Benjamin, Nachman

× Benjamin, Nachman

Benjamin, Nachman

Search repository
Yutaro, Iiyama

× Yutaro, Iiyama

Yutaro, Iiyama

Search repository
Tomoe, Kishimoto

× Tomoe, Kishimoto

Tomoe, Kishimoto

Search repository
Ryunosuke, Okubo

× Ryunosuke, Okubo

Ryunosuke, Okubo

Search repository
Ryu, Sawada

× Ryu, Sawada

Ryu, Sawada

Search repository
Junichi, Tanaka

× Junichi, Tanaka

Junichi, Tanaka

Search repository
著者名(英) Wonho, Jang

× Wonho, Jang

en Wonho, Jang

Search repository
Koji, Terashi

× Koji, Terashi

en Koji, Terashi

Search repository
Masahiko, Saito

× Masahiko, Saito

en Masahiko, Saito

Search repository
Christian, W. Bauer

× Christian, W. Bauer

en Christian, W. Bauer

Search repository
Benjamin, Nachman

× Benjamin, Nachman

en Benjamin, Nachman

Search repository
Yutaro, Iiyama

× Yutaro, Iiyama

en Yutaro, Iiyama

Search repository
Tomoe, Kishimoto

× Tomoe, Kishimoto

en Tomoe, Kishimoto

Search repository
Ryunosuke, Okubo

× Ryunosuke, Okubo

en Ryunosuke, Okubo

Search repository
Ryu, Sawada

× Ryu, Sawada

en Ryu, Sawada

Search repository
Junichi, Tanaka

× Junichi, Tanaka

en Junichi, Tanaka

Search repository
論文抄録
内容記述タイプ Other
内容記述 There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivities, and coherence times, circuit optimization is essential to make the best use of near-term quantum devices. We introduce two separate ideas for circuit optimization and combine them in a multi-tiered quantum circuit optimization protocol called AQCEL. The first ingredient is a technique to recognize repeated patterns of quantum gates, opening up the possibility of future hardware co-optimization. The second ingredient is an approach to reduce circuit complexity by identifying zero- or low-amplitude computational basis states and redundant gates. As a demonstration, AQCEL is deployed on an iterative and efficient quantum algorithm designed to model final state radiation in high energy physics. For this algorithm, our optimization scheme brings a significant reduction in the gate count without losing any accuracy compared to the original circuit. Additionally, we have investigated whether this can be demonstrated on a quantum computer using polynomial resources. Our technique is generic and can be useful for a wide variety of quantum algorithms.
論文抄録(英)
内容記述タイプ Other
内容記述 There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivities, and coherence times, circuit optimization is essential to make the best use of near-term quantum devices. We introduce two separate ideas for circuit optimization and combine them in a multi-tiered quantum circuit optimization protocol called AQCEL. The first ingredient is a technique to recognize repeated patterns of quantum gates, opening up the possibility of future hardware co-optimization. The second ingredient is an approach to reduce circuit complexity by identifying zero- or low-amplitude computational basis states and redundant gates. As a demonstration, AQCEL is deployed on an iterative and efficient quantum algorithm designed to model final state radiation in high energy physics. For this algorithm, our optimization scheme brings a significant reduction in the gate count without losing any accuracy compared to the original circuit. Additionally, we have investigated whether this can be demonstrated on a quantum computer using polynomial resources. Our technique is generic and can be useful for a wide variety of quantum algorithms.
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AA12894105
書誌情報 研究報告量子ソフトウェア(QS)

巻 2021-QS-2, 号 14, p. 1-11, 発行日 2021-03-22
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 18:06:51.640744
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