{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00233681","sets":["1164:10193:11470:11538"]},"path":["11538"],"owner":"44499","recid":"233681","title":["平均場アニーリングに基づく高性能な全並列型アニーリングアルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-03-21"},"_buckets":{"deposit":"3b83ce3c-ae0c-4d26-85f5-94f356fea977"},"_deposit":{"id":"233681","pid":{"type":"depid","value":"233681","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"平均場アニーリングに基づく高性能な全並列型アニーリングアルゴリズム","author_link":["635287","635286","635288","635289","635290"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"平均場アニーリングに基づく高性能な全並列型アニーリングアルゴリズム"}]},"item_type_id":"4","publish_date":"2024-03-21","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京工業大学"},{"subitem_text_value":"東京工業大学"},{"subitem_text_value":"東京工業大学"},{"subitem_text_value":"東京工業大学"},{"subitem_text_value":"東京工業大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Tokyo Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Tokyo Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Tokyo Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Tokyo Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Tokyo 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/233681/files/IPSJ-QS24011007.pdf","label":"IPSJ-QS24011007.pdf"},"date":[{"dateType":"Available","dateValue":"2026-03-21"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-QS24011007.pdf","filesize":[{"value":"5.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":"a48edce7-2aa9-423b-aee6-a49e785d2d86","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":"Thiem, Van Chu"}],"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":"近年，量子アニーリングを契機として，様々な組合せ最適化問題をスピングラス理論に基づくイジングモデルにマッピングして解くアニーリング手法の研究が活発に行われている．特に，古典熱力学に根ざしたシミュレーテッドアニーリングの拡張として，あるいは量子論に着想を得たアルゴリズムとして，全変数を同時に更新できる並列型アニーリングアルゴリズム（PAA: Parallel Annealing Algorithm）は，並列計算機を用いて高速に最適化できる手法として注目されている．本稿では，アナログ変数を決定論的に更新するというユニークな特徴を持つ平均場アニーリングに基づく新しい PAA を提案し，提案 PAA は従来 PAA に比べて高いロバスト性と高速性を兼ね備えていることを示す．典型的な 3 種類の組合せ最適化問題（最大カット問題，最大独立集合問題，巡回セールスマン問題）を用いて実験を行い，提案 PAA の高い性能を実証する．近年量子論に基づくアルゴリズムが発展しており，古典熱力学に基づくアルゴリズムよりも優れるものとして成果が報告されている．しかし，提案 PAA は古典的熱力学に基づいているにも関わらず最先端 PAA と同等以上の性能を誇り，この結果は，実際の物理現象が利用されない限りは量子論に基づくアルゴリズムが古典的な熱力学に基づくアルゴリズムよりも優れる訳ではないことを示唆する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"10","bibliographic_titles":[{"bibliographic_title":"研究報告量子ソフトウェア（QS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-03-21","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"7","bibliographicVolumeNumber":"2024-QS-11"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:35:12.107175+00:00","updated":"2025-01-19T10:01:29.674177+00:00","id":233681}