{"updated":"2025-01-19T07:59:54.228196+00:00","links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00240380","sets":["1164:10193:11470:11768"]},"path":["11768"],"owner":"44499","recid":"240380","title":["QCNNにおける効率的なチャネル計算アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-10-21"},"_buckets":{"deposit":"a289f16e-4b22-4b4d-99f6-eef9cad5c391"},"_deposit":{"id":"240380","pid":{"type":"depid","value":"240380","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"QCNNにおける効率的なチャネル計算アルゴリズム","author_link":["659326","659327","659329","659328"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"QCNNにおける効率的なチャネル計算アルゴリズム"},{"subitem_title":"Efficient Algorithm for Computing Channels of QCNN","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2024-10-21","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"奈良先端科学技術大学院大学／理化学研究所ロボットガーディアンプロジェクト"},{"subitem_text_value":"国立情報学研究所大規模言語モデル研究開発センター／理化学研究所ロボットガーディアンプロジェクト"},{"subitem_text_value":"理化学研究所ロボットガーディアンプロジェクト／奈良先端科学技術大学院大学"},{"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/240380/files/IPSJ-QS24013015.pdf","label":"IPSJ-QS24013015.pdf"},"date":[{"dateType":"Available","dateValue":"2026-10-21"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-QS24013015.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":"53"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"2045ae76-497d-42ee-9496-4ed626dfebed","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 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":[{}]}]},"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":"様々な応用可能性と量子計算への相性の良さから，量子畳み込みニューラルネットワーク (QCNN) への注目が高まっている．量子畳み込み学習は性能面で優れているものの，重みフィルタの数だけ量子回路を呼び出す必要があり，計算効率に課題があった．本研究では，この重みフィルタ数とチャネル数の関係に着目し，計算アルゴリズムを効率化することを提案する．具体的には，複数のパウリ演算を観測して効率的に量子状態を次の層に残すことで，チャネル数の削減を行った．この手法により，精度を維持しつつパラメータ数及び計算時間を大きく削減できることを確認した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Due to its various potential applications and suitability for quantum computing, there is growing interest in quantum convolutional neural networks (QCNNs). Although QCNN is superior in terms of performance, it has the problem of computational efficiency, as it requires many calls of a quantum circuit corresponding in proportion to the number weight filters. In this study, we propose an efficient computational algorithm by focusing on the relationship between the number of weight filters and the number of channels. Specifically, we reduced the number of channels by efficiently remain the quantum state in the next layer by observing multiple Pauli operations. We confirmed that this method can greatly reduce the number of parameters and calculation time while maintaining accuracy.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告量子ソフトウェア（QS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-10-21","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"15","bibliographicVolumeNumber":"2024-QS-13"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":240380,"created":"2025-01-19T01:44:32.600811+00:00"}