{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00225071","sets":["1164:10193:11168:11169"]},"path":["11169"],"owner":"44499","recid":"225071","title":["分割統治量子探索アルゴリズムを用いた組合せ最適化問題の実行可能解の解法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-03-06"},"_buckets":{"deposit":"b6d70596-5fd4-44c0-b2a9-42f1220fb474"},"_deposit":{"id":"225071","pid":{"type":"depid","value":"225071","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"分割統治量子探索アルゴリズムを用いた組合せ最適化問題の実行可能解の解法","author_link":["594889","594888","594887","594890"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"分割統治量子探索アルゴリズムを用いた組合せ最適化問題の実行可能解の解法"}]},"item_type_id":"4","publish_date":"2023-03-06","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"株式会社KDDI総合研究所／東京理科大学"},{"subitem_text_value":"株式会社KDDI総合研究所"},{"subitem_text_value":"東京理科大学"},{"subitem_text_value":"芝浦工業大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"KDDI Research, Inc. / Tokyo University of Science","subitem_text_language":"en"},{"subitem_text_value":"KDDI Research, Inc.","subitem_text_language":"en"},{"subitem_text_value":"Tokyo University of Science","subitem_text_language":"en"},{"subitem_text_value":"Shibaura Institute of Technology","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/225071/files/IPSJ-QS23008035.pdf","label":"IPSJ-QS23008035.pdf"},"date":[{"dateType":"Available","dateValue":"2025-03-06"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-QS23008035.pdf","filesize":[{"value":"1.7 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":"17511d12-ef17-4304-99d0-b4fe473da75d","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":[{}]}]},"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":"Grover アルゴリズムをはじめとする量子探索アルゴリズムは，制約付き組合せ最適化問題を効率的に解くための有効な手段の一つである．量子探索アルゴリズムで制約付き組合せ最適化問題を解く場合，実行可能解の数に応じてオラクル演算子を量子回路上に埋め込む必要がある．しかし，この埋込に指数関数の計算量を要するため，量子探索アルゴリズムで大規模な制約付き組合せ最適化問題を高速に解くことは困難であった．そこで本研究では，分割統治法を従来の量子探索アルゴリズムに適用した，分割統治量子探索アルゴリズムを提案する．組合せ最適化問題の各制約項を小問題に分割し，小問題ごとに量子探索を行う量子回路を設計する．巡回セールスマン問題の実行可能解を求める問題を例として，提案手法と Grover アルゴリズム及び古典計算量と比較する．その結果，提案手法の分割統治量子探索アルゴリズムを使用することで，実行可能解の取得に必要な計算量を大幅に削減できることがわかった．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"9","bibliographic_titles":[{"bibliographic_title":"研究報告量子ソフトウェア（QS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-03-06","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"35","bibliographicVolumeNumber":"2023-QS-8"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":225071,"updated":"2025-01-19T12:56:09.404743+00:00","links":{},"created":"2025-01-19T01:24:35.173856+00:00"}