{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00197519","sets":["1164:1579:9681:9819"]},"path":["9819"],"owner":"44499","recid":"197519","title":["NISQにおけるfidelityが処理時間へ与える影響の解析～古典-量子ハイブリッドアーキテクチャの実現に向けて～"],"pubdate":{"attribute_name":"公開日","attribute_value":"2019-06-04"},"_buckets":{"deposit":"34975ee4-558a-4618-80f8-970d61d5c094"},"_deposit":{"id":"197519","pid":{"type":"depid","value":"197519","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"NISQにおけるfidelityが処理時間へ与える影響の解析～古典-量子ハイブリッドアーキテクチャの実現に向けて～","author_link":["473944","473940","473939","473943","473942","473941"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"NISQにおけるfidelityが処理時間へ与える影響の解析～古典-量子ハイブリッドアーキテクチャの実現に向けて～"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"アーキテクチャ・計算方式","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2019-06-04","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"九州大学大学院システム情報科学府情報知能工学専攻"},{"subitem_text_value":"九州大学情報基盤研究開発センター"},{"subitem_text_value":"九州大学大学院システム情報科学府I&Eビジョナリー特別部門"},{"subitem_text_value":"東京大学先端科学技術研究センター"},{"subitem_text_value":"九州大学大学院システム情報科学府I&Eビジョナリー特別部門"},{"subitem_text_value":"九州大学大学院システム情報科学研究院情報知能工学部門"}]},"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/197519/files/IPSJ-ARC19236013.pdf","label":"IPSJ-ARC19236013.pdf"},"date":[{"dateType":"Available","dateValue":"2021-06-04"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ARC19236013.pdf","filesize":[{"value":"1.5 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":"16"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"4c750136-9472-45a6-ab18-774d24c7ff12","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2019 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":[{}]},{"creatorNames":[{"creatorName":"井上, 弘士"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10096105","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-8574","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"近年，MOSFET で実装された一般的なコンピュータ (古典コンピュータ) の性能限界が指摘されている．この問題を解決する方法の一つとして量子コンピュータが挙げられる．量子コンピュータでは，基本デバイスである量子ビットによる超並列処理が可能となる．量子コンピュータは同一の処理を繰り返し行い，出力されたデータをもとに確率分布の推定を行い解を導出する．しかし，今現在量子コンピュータの解を導出するための推定には最尤推定が用いられており，決め打ちされた実行回数から得られたデータの出現確率をそのまま確率分布に置き換えている．すなわち，必要十分な確率分布推定が行われていない可能性がある．そのため，量子コンピュータの解の確率分布に対して最適な推定方法を導入する必要がある．本研究では NISQ 向けの性能評価環境を構築し，確率分布の推定に必要となる最小の実行回数と fidelity の関係を解析した．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"10","bibliographic_titles":[{"bibliographic_title":"研究報告システム・アーキテクチャ（ARC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2019-06-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"13","bibliographicVolumeNumber":"2019-ARC-236"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:01:58.405083+00:00","updated":"2025-01-19T22:19:00.598878+00:00","id":197519}