{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00233692","sets":["1164:10193:11470:11538"]},"path":["11538"],"owner":"44499","recid":"233692","title":["ブラックボックス逐次化可能性問題に対するQAOAの評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-03-21"},"_buckets":{"deposit":"fea0b0a9-3e8d-4e3d-9d0e-41516882df33"},"_deposit":{"id":"233692","pid":{"type":"depid","value":"233692","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"ブラックボックス逐次化可能性問題に対するQAOAの評価","author_link":["635342","635340","635339","635341"],"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":"慶應義塾大学"},{"subitem_text_value":"慶應義塾大学"},{"subitem_text_value":"株式会社KDDI総合研究所"},{"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/233692/files/IPSJ-QS24011018.pdf","label":"IPSJ-QS24011018.pdf"},"date":[{"dateType":"Available","dateValue":"2026-03-21"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-QS24011018.pdf","filesize":[{"value":"1.3 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":"e5bfd324-bee3-4d6a-92e5-39d7ed97d89f","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":[{}]}]},"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":"データベースのトランザクションが結果の正確さを保ちながら並行実行可能であるとき，逐次化可能性を持つという．クラウドデータベースなど，ユーザーが内部実装を確認できない環境において，逐次化可能性を判断するブラックボックス逐次化可能性問題は NP 完全に分類される．先行研究では本問題に量子アニーリングを適用しているが，そのハードウェア実装において実行可能な問題の規模に制約がある．一方で，ゲート型の量子コンピュータの実装が量子アニーリングの実装を上回る速度で拡大しており，より規模の大きい問題への適用が期待できる．そこで本研究では，ゲート型の量子コンピュータで実行可能な量子アルゴリズムの 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":"2024-03-21","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"18","bibliographicVolumeNumber":"2024-QS-11"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T10:01:15.413134+00:00","created":"2025-01-19T01:35:13.167638+00:00","id":233692}