{"id":227134,"updated":"2025-01-19T12:15:56.135891+00:00","links":{},"created":"2025-01-19T01:26:26.872650+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00227134","sets":["1164:2240:11176:11310"]},"path":["11310"],"owner":"44499","recid":"227134","title":["状態ベクトルに基づく並列量子回路シミュレーションにおける量子ビット交換の削減のための演算スケジューリング"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-07-27"},"_buckets":{"deposit":"62d63918-5c6e-48a4-9fc4-310c2bd4be1b"},"_deposit":{"id":"227134","pid":{"type":"depid","value":"227134","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"状態ベクトルに基づく並列量子回路シミュレーションにおける量子ビット交換の削減のための演算スケジューリング","author_link":["604643","604645","604642","604644","604641"],"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":"4","publish_date":"2023-07-27","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学大学院情報科学研究科/大阪大学量子情報・量子生命研究センター"},{"subitem_text_value":"大阪大学基礎工学部/大阪大学量子情報・量子生命研究センター"},{"subitem_text_value":"大阪大学量子情報・量子生命研究センター"},{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University / Center for Quantum Information and Quantum Biology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"School of Engineering Science, Osaka University / Center for Quantum Information and Quantum Biology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Center for Quantum Information and Quantum Biology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/227134/files/IPSJ-HPC23190023.pdf","label":"IPSJ-HPC23190023.pdf"},"date":[{"dateType":"Available","dateValue":"2025-07-27"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-HPC23190023.pdf","filesize":[{"value":"1.4 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":"14"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"d58a8252-a17e-48b7-8e7b-116b67768009","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"寺西, 勇裕"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"平岡, 昇真"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"水上, 渉"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"置田, 真生"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"伊野, 文彦"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10463942","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8841","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本報告の目的は,状態ベクトル(SV)に基づく並列量子回路シミュレーション(p-SVQCS)における並列化効率の改善である.p-SVQCS は,SV を複数の計算機に分散配置し,計算内容に応じて SV の配置を入れ替える計算機間通信 Qubit Reordering(QR)を実行する.p-SVQCS は QR 回数の増加に伴い通信時間が増大することで並列化効率が低下するが,QR 回数を削減するための効率の良い手法は明らかでない.そこで,本研究は代表的な量子古典ハイブリッドアルゴリズムである変分量子固有値法(VQE)を対象に,QR 回数を削減するための演算スケジューリング手法を提案する.VQE は主に (1) 量子状態更新と (2) 期待値計算の 2 段階からなる.提案手法は,連続する 2 つの QR 間における計算の粒度が増大するように演算順序を入れ替えることで総 QR 回数を削減する.まず,(1) に対して,量子回路に時空間タイリングを適用することで演算順序を決定する.次に,(2) に対して,依存関係に基づいて演算をグループ化することで,QR 間の粒度が最大となる演算スケジュールを多項式時間で求める.NVIDIA cuQuantum を用いた複数 GPU 実行に対する評価の結果,提案手法は (1) および (2) における QR 回数を,演算を定義順に実行する手法と比較してそれぞれ 1/60 および 1/4448 に削減した.提案手法は,単一ノード複数 GPU 実行において (1)(2) ともに 0.96 を上回る並列化効率を達成し,p-SVQCS における有用性を示した.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"11","bibliographic_titles":[{"bibliographic_title":"研究報告ハイパフォーマンスコンピューティング(HPC)"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-07-27","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"23","bibliographicVolumeNumber":"2023-HPC-190"}]},"relation_version_is_last":true,"weko_creator_id":"44499"}}