{"created":"2025-01-19T01:14:06.207278+00:00","updated":"2025-01-19T17:14:15.766965+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00213197","sets":["1164:10193:10565:10720"]},"path":["10720"],"owner":"44499","recid":"213197","title":["最大カットに対するQAOAと古典近似アルゴリズムの近似率"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-10-07"},"_buckets":{"deposit":"8eb53b06-fe13-4c56-97c7-276ec7e3a3a1"},"_deposit":{"id":"213197","pid":{"type":"depid","value":"213197","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"最大カットに対するQAOAと古典近似アルゴリズムの近似率","author_link":["545057","545058"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"最大カットに対するQAOAと古典近似アルゴリズムの近似率"}]},"item_type_id":"4","publish_date":"2021-10-07","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"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/213197/files/IPSJ-QS21004003.pdf","label":"IPSJ-QS21004003.pdf"},"date":[{"dateType":"Available","dateValue":"2023-10-07"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-QS21004003.pdf","filesize":[{"value":"811.3 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":"30e4035f-1bea-4b01-aa85-df1828bdde92","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 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":"量子計算と古典計算の近似アルゴリズムで，近似率の保証をもつものの間では，比較の公平性に注意してであるが，その近似率に関する比較が可能となる．本稿では，最大カット問題に対する量子・古典近似アルゴリズムについて，この比較を行ってまとめる．その中で，第 2 著者による古典近似アルゴリズムについても触れる．量子計算での近似アルゴリズムとしては，近似率に関する成果も出ている QAOA に着目する．近似率は，近似アルゴリズム設計・解析と計算量理論で軸となるものであり，その比較から近似率の観点で量子優位性が成り立つのかが調べられている．なお，これらまとめの中で，量子メタヒューリスティックスの解析での理論結果の適格な適用についても触れる．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"量子ソフトウェア（QS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2021-10-07","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2021-QS-4"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":213197,"links":{}}