{"updated":"2025-01-19T15:02:18.638815+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00218777","sets":["1164:10193:10905:10966"]},"path":["10966"],"owner":"44499","recid":"218777","title":["誤り耐性量子計算におけるSELECT回路の並列化と高速化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-06-30"},"_buckets":{"deposit":"fad71921-ab47-46d4-a151-a620dbd3ac42"},"_deposit":{"id":"218777","pid":{"type":"depid","value":"218777","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"誤り耐性量子計算におけるSELECT回路の並列化と高速化","author_link":["569671","569672"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"誤り耐性量子計算におけるSELECT回路の並列化と高速化"},{"subitem_title":"Parallelization and optimization of SELECT operations in fault-tolerant quantum computing","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2022-06-30","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"NTTコンピュータ&データサイエンス研究所／JSTさきがけ"},{"subitem_text_value":"東京大学工学系研究科物理工学専攻／NTTコンピュータ&データサイエンス研究所"}]},"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/218777/files/IPSJ-QS22006018.pdf","label":"IPSJ-QS22006018.pdf"},"date":[{"dateType":"Available","dateValue":"2024-06-30"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-QS22006018.pdf","filesize":[{"value":"780.7 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"53"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"36f74086-cd38-446e-b62c-c999e5c2c544","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 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":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12894105","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":"2435-6492","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"初期の誤り耐性量子計算機で計算速度での量子優位性を示すには，利用する量子アルゴリズムや回路への分解が計算機の設計や状況に最適化されていることが望ましい．特に，SELECT と呼ばれる操作は初期に応用が見込まれている Qubitization に基づく位相推定でボトルネックとなる構造であり，最適化する需要が大きい．しかし，SELECT 操作を計算機で利用できるリソースの状況に応じて調整可能な形で実現する回路のデザインは知られていなかった．本研究では並列化により計算機の状況に合わせて速度とリソース消費の速度を変更可能な DistSELECT 回路を提案する．この原稿では DistSELECT を解析的/数値的に性能を見積もり，隣接相互するスピン系のハミルトニアンを少ない命令のストールでエンコードする方法を議論する．さらに，複数のチップに分散された計算における論理ビット割り当ての最適化についても議論する．こうした解析を通し，本手法は論理量子ビットの数をハミルトニアンの項の数に対して増やすことにより，誤り耐性量子計算の実行速度を特徴づけるいくつかのパラメータを反比例的に小さくすることができることを明らかにする．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Adaptive optimization of quantum circuit decomposition according to the status of a fault-tolerant quantum computer is essential for demonstrating quantum computational advantage in an early stage. In particular, SELECT operations, which are a core part of the state-of-the-art construction of quantum phase estimation, are known as the bottleneck of a wide range of applications, and there is strong demand to optimize them as an efficient and tunable form. In this paper, we propose a tunable, efficient, and easy-to-distribute design of SELECT operation, which we call DistSELECT. We analyze and numerically evaluate the performance of DistSELECT with several metrics. We also discuss their efficient implementation for interacting two-dimensional spin systems in the cases of a single node and distributed systems. We reveal that the proposed construction reduces reaction times and non-local operations by modest increase of the ancillary logical qubits.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"11","bibliographic_titles":[{"bibliographic_title":"量子ソフトウェア（QS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-06-30","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"18","bibliographicVolumeNumber":"2022-QS-6"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:19:07.492524+00:00","id":218777,"links":{}}