{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00233688","sets":["1164:10193:11470:11538"]},"path":["11538"],"owner":"44499","recid":"233688","title":["線形化したQAOAパラメータと問題インスタンス間の転送可能性"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-03-21"},"_buckets":{"deposit":"44c3ed2c-fe08-42d4-95db-adf8f6c76aef"},"_deposit":{"id":"233688","pid":{"type":"depid","value":"233688","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"線形化したQAOAパラメータと問題インスタンス間の転送可能性","author_link":["635319","635320","635321","635322","635318"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"線形化したQAOAパラメータと問題インスタンス間の転送可能性"}]},"item_type_id":"4","publish_date":"2024-03-21","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Jij Inc."},{"subitem_text_value":"Jij Inc."},{"subitem_text_value":"Jij Inc."},{"subitem_text_value":"Jij Inc."},{"subitem_text_value":"Osaka University／RIKEN"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Jij Inc.","subitem_text_language":"en"},{"subitem_text_value":"Jij Inc.","subitem_text_language":"en"},{"subitem_text_value":"Jij Inc.","subitem_text_language":"en"},{"subitem_text_value":"Jij Inc.","subitem_text_language":"en"},{"subitem_text_value":"Osaka University / RIKEN","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/233688/files/IPSJ-QS24011014.pdf","label":"IPSJ-QS24011014.pdf"},"date":[{"dateType":"Available","dateValue":"2026-03-21"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-QS24011014.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":"b155b05c-1d3b-4dd7-a76c-be9bcf77f676","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":[{}]},{"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":"組合せ最適化問題を解くための方法として Quantum Approximate Optimization Algorithm (QAOA) というアルゴリズムがある．QAOA 回路は問題のハミルトニアンによる時間発展演算子と状態を「混ぜる」効果を持つ演算子からなる層の繰り返しとして表され，測定結果として得られるコスト関数を最小化 (あるいは最大化) するように各層の角度パラメータが調節される．パラメータの探索はいわば古典的に行なうことになるが，そこでパラメータやその初期値の決定戦略についての研究や，グラフの構造に着目して問題インスタンス間の共通点を抽出しようといった試みがこれまでになされている．本研究では各層の深さについて線形であるように単純化した QAOA パラメータの性質を調べた．このような単純化は量子アニーリングとの類推などから示唆されるものでもあり，p 層の QAOA 回路において調節するべきパラメータが 2p 個から 4 個に削減されることは古典的な探索過程が大きく簡略化されるという利点も持つ．加えて，パラメータ空間におけるコスト関数の概形が問題インスタンスの変化に対していくらかの安定性を持つことが分かった．このことは，あるインスタンスについて得た最適な QAOA パラメータが他インスタンスへ転送可能であることを示唆する．本稿では，ランダム Ising 模型や最大カット問題といった典型的な問題について得た結果を議論する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告量子ソフトウェア（QS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-03-21","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"14","bibliographicVolumeNumber":"2024-QS-11"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":233688,"updated":"2025-01-19T10:01:21.595716+00:00","links":{},"created":"2025-01-19T01:35:12.783858+00:00"}