{"updated":"2025-01-19T12:11:18.633565+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00227392","sets":["6164:6165:7651:11316"]},"path":["11316"],"owner":"44499","recid":"227392","title":["量子ビット読み出し時間を削減するトポロジ周期性活用のマイナ埋め込み手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-08-23"},"_buckets":{"deposit":"453b59b6-8865-4d85-919c-f5e97a3cc470"},"_deposit":{"id":"227392","pid":{"type":"depid","value":"227392","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"量子ビット読み出し時間を削減するトポロジ周期性活用のマイナ埋め込み手法","author_link":["605673","605674"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"量子ビット読み出し時間を削減するトポロジ周期性活用のマイナ埋め込み手法"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"次世代コンピューティング","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2023-08-23","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"早稲田大学グリーン・コンピューティング・システム研究機構"},{"subitem_text_value":"早稲田大学基幹理工学部情報通信学科"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/227392/files/IPSJ-DAS2023027.pdf","label":"IPSJ-DAS2023027.pdf"},"date":[{"dateType":"Available","dateValue":"2025-08-23"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DAS2023027.pdf","filesize":[{"value":"1.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"10"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"2212442c-2861-4238-a892-e393e123bd32","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"多和田, 雅師"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"戸川, 望"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"マイナ埋め込みは量子アニーリングの実行時にレイテンシ増加を引き起こす．レイテンシの削減を目指すために，全結合グラフからハードウェアトポロジへのマイナ埋め込みパタンを事前に準備する戦略が存在する．既存の手法では，入力された論理イジングモデルを全結合グラフとして扱い，実行時のマイナ埋め込みを省略するためにマイナ埋め込みパタンを生成する．我々は，量子ビットの個々のばらつきが既存の手法の読み出し時間を増加させることを発見した．本稿では，量子ビットの個々のばらつきを考慮に入れ，読み出し時間を最小化する全結合グラフのマイナ埋め込み手法を提案する．提案手法では，量子アニーリングマシンのハードウェアトポロジに周期性が存在することに注目し，元のマイナ埋め込みパタンをユニットセルごとにシフトさせて読み出し時間が最小となるマイナ埋め込みパタンを探索する．計算機実験により，提案した手法は既存手法と比較して，量子アニーリングの実行時間の一部である読み出し時間を削減することが確認された．","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"172","bibliographic_titles":[{"bibliographic_title":"DAシンポジウム2023論文集"}],"bibliographicPageStart":"167","bibliographicIssueDates":{"bibliographicIssueDate":"2023-08-23","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2023"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:26:39.549448+00:00","id":227392,"links":{}}