ログイン 新規登録
言語:

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

Connecting Quantum Systems with Classical Wires

https://ipsj.ixsq.nii.ac.jp/records/225065
https://ipsj.ixsq.nii.ac.jp/records/225065
b35cac36-b3be-4118-aa93-57097c6822e6
名前 / ファイル ライセンス アクション
IPSJ-QS23008029.pdf IPSJ-QS23008029.pdf (835.5 kB)
Copyright (c) 2023 by the Information Processing Society of Japan
オープンアクセス
Item type SIG Technical Reports(1)
公開日 2023-03-06
タイトル
タイトル Connecting Quantum Systems with Classical Wires
タイトル
言語 en
タイトル Connecting Quantum Systems with Classical Wires
言語
言語 eng
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_18gh
資源タイプ technical report
著者所属
Department of Applied Physics and Physico-Informatics, Keio University
著者所属
Department of Applied Physics and Physico-Informatics, Keio University
著者所属
Department of Applied Physics and Physico-Informatics, Keio University/Quantum Computing Center, Keio University
著者所属(英)
en
Department of Applied Physics and Physico-Informatics, Keio University
著者所属(英)
en
Department of Applied Physics and Physico-Informatics, Keio University
著者所属(英)
en
Department of Applied Physics and Physico-Informatics, Keio University / Quantum Computing Center, Keio University
著者名 Hiroyuki, Harada

× Hiroyuki, Harada

Hiroyuki, Harada

Search repository
Kaito, Wada

× Kaito, Wada

Kaito, Wada

Search repository
Naoki, Yamamoto

× Naoki, Yamamoto

Naoki, Yamamoto

Search repository
著者名(英) Hiroyuki, Harada

× Hiroyuki, Harada

en Hiroyuki, Harada

Search repository
Kaito, Wada

× Kaito, Wada

en Kaito, Wada

Search repository
Naoki, Yamamoto

× Naoki, Yamamoto

en Naoki, Yamamoto

Search repository
論文抄録
内容記述タイプ Other
内容記述 To overcome the limitation of the quality and quantity of qubits in currenet quantum devices, quantum circuit cutting technique has been proposed. This techniques take a strategy to cut a quantum circuit, enabling us to execute quantum simulations requiring more qubits than physically available. Although this method is appealing, there is a problem that the sampling cost grows exponentially with the number of cuts, so it is important to pursue decomposition methods with small sampling costs. In this work, we propose a method of decomposing a single-qubit identity channel, which achieves a optimal sampling costs without any ancilla qubits. Furthermore, we give optimal decomposition of a n-qubit parallel identity channels. While recent studies have shown that the use of a pre-shared Bell pairs allows for optimal decomposition of n-qubit parallel identity channels, our method does not require that resources but achieve the same sampling costs.
論文抄録(英)
内容記述タイプ Other
内容記述 To overcome the limitation of the quality and quantity of qubits in currenet quantum devices, quantum circuit cutting technique has been proposed. This techniques take a strategy to cut a quantum circuit, enabling us to execute quantum simulations requiring more qubits than physically available. Although this method is appealing, there is a problem that the sampling cost grows exponentially with the number of cuts, so it is important to pursue decomposition methods with small sampling costs. In this work, we propose a method of decomposing a single-qubit identity channel, which achieves a optimal sampling costs without any ancilla qubits. Furthermore, we give optimal decomposition of a n-qubit parallel identity channels. While recent studies have shown that the use of a pre-shared Bell pairs allows for optimal decomposition of n-qubit parallel identity channels, our method does not require that resources but achieve the same sampling costs.
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AA12894105
書誌情報 研究報告量子ソフトウェア(QS)

巻 2023-QS-8, 号 29, p. 1-7, 発行日 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:17.458502
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