{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00217629","sets":["1164:10193:10905:10906"]},"path":["10906"],"owner":"44499","recid":"217629","title":["Transferring Optimal QAOA Parameters Between Regular Graphs for Larger Circuit Depth"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-03-17"},"_buckets":{"deposit":"3d57d0b4-58cb-4935-ab56-90c7b4f18807"},"_deposit":{"id":"217629","pid":{"type":"depid","value":"217629","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Transferring Optimal QAOA Parameters Between Regular Graphs for Larger Circuit Depth","author_link":["564182","564180","564181","564175","564179","564178","564177","564176"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Transferring Optimal QAOA Parameters Between Regular Graphs for Larger Circuit Depth"},{"subitem_title":"Transferring Optimal QAOA Parameters Between Regular Graphs for Larger Circuit Depth","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2022-03-17","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"University of Tsukuba"},{"subitem_text_value":"University of Tsukuba"},{"subitem_text_value":"University of Tsukuba"},{"subitem_text_value":"University of Aizu"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"University of Aizu","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/217629/files/IPSJ-QS22005007.pdf","label":"IPSJ-QS22005007.pdf"},"date":[{"dateType":"Available","dateValue":"2024-03-17"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-QS22005007.pdf","filesize":[{"value":"1.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":"675f28cc-0ff8-4079-acaa-e6f7dee92afe","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":"Ningyi, Xie"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Xinwei, Lee"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Dongsheng, Cai"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Nobuyoshi, Asai"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ningyi, Xie","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Xinwei, Lee","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Dongsheng, Cai","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Nobuyoshi, Asai","creatorNameLang":"en"}],"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":"The Quantum approximate optimization algorithm (QAOA) is a quantum algorithm that aims to produce approximate solutions for combinatorial optimization problems. The quantum circuit parameters of QAOA are optimized to find the optimal solution. Recent research found that, for the Max-cut problem, the optimal parameters of the QAOA circuit for one graph with small number of nodes can be used for another graph with larger number of nodes if their degrees have the same parity. In this paper, we come up with the conjecture of the condition of parameter transfer for larger circuit Depth QAOA, and numerically verify it for regular graphs.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The Quantum approximate optimization algorithm (QAOA) is a quantum algorithm that aims to produce approximate solutions for combinatorial optimization problems. The quantum circuit parameters of QAOA are optimized to find the optimal solution. Recent research found that, for the Max-cut problem, the optimal parameters of the QAOA circuit for one graph with small number of nodes can be used for another graph with larger number of nodes if their degrees have the same parity. In this paper, we come up with the conjecture of the condition of parameter transfer for larger circuit Depth QAOA, and numerically verify it for regular graphs.","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-03-17","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"7","bibliographicVolumeNumber":"2022-QS-5"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":217629,"updated":"2025-01-19T15:26:13.514086+00:00","links":{},"created":"2025-01-19T01:18:07.120159+00:00"}