{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00220413","sets":["1164:10193:10905:11012"]},"path":["11012"],"owner":"44499","recid":"220413","title":["制約つき組合せ最適化問題のための後処理量子近似最適化アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-10-20"},"_buckets":{"deposit":"1a655bb4-8a20-458f-80d7-63fa749a9089"},"_deposit":{"id":"220413","pid":{"type":"depid","value":"220413","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"制約つき組合せ最適化問題のための後処理量子近似最適化アルゴリズム","author_link":["576558"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"制約つき組合せ最適化問題のための後処理量子近似最適化アルゴリズム"}]},"item_type_id":"4","publish_date":"2022-10-20","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"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/220413/files/IPSJ-QS22007009.pdf","label":"IPSJ-QS22007009.pdf"},"date":[{"dateType":"Available","dateValue":"2024-10-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-QS22007009.pdf","filesize":[{"value":"3.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":"53"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"9ceea8cc-be81-45c5-997e-41e1e3c5c680","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":[{}]}]},"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":"量子近似最適化アルゴリズム (QAOA; Quantum Approximate Optimization Algorithm) は，ゲート型量子計算機で動作する組合せ最適化問題のための量子アルゴリズムである．本稿では，QAOA において量子状態を測定した解に対し後処理を追加した量子アルゴリズムである，後処理量子近似最適化アルゴリズム (pQAOA) を提案する．グラフ分割問題と二次ナップサック問題に対して，非実行可能解を実行可能解に変換する後処理方法を考案し，それぞれの問題に対し pQAOA の QAOA に対する優位性を明らかにした．","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":"2022-10-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicVolumeNumber":"2022-QS-7"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":220413,"updated":"2025-01-19T14:34:57.932717+00:00","links":{},"created":"2025-01-19T01:20:27.483044+00:00"}