{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00217642","sets":["1164:10193:10905:10906"]},"path":["10906"],"owner":"44499","recid":"217642","title":["Distributed Qubit Allocation that Minimizes the Total Execution Time for Heterogeneous Quantum Computing"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-03-17"},"_buckets":{"deposit":"cd0ec464-6473-41b4-8475-090e059e8666"},"_deposit":{"id":"217642","pid":{"type":"depid","value":"217642","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Distributed Qubit Allocation that Minimizes the Total Execution Time for Heterogeneous Quantum Computing","author_link":["564238","564237","564239","564240"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Distributed Qubit Allocation that Minimizes the Total Execution Time for Heterogeneous Quantum Computing"},{"subitem_title":"Distributed Qubit Allocation that Minimizes the Total Execution Time for Heterogeneous Quantum Computing","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":"Faculty of Environment and Information Studies, Keio University SFC／Keio University Quantum Computing Center"},{"subitem_text_value":"Faculty of Environment and Information Studies, Keio University SFC／Keio University Quantum Computing Center"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Faculty of Environment and Information Studies, Keio University SFC / Keio University Quantum Computing Center","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Environment and Information Studies, Keio University SFC / Keio University Quantum Computing Center","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/217642/files/IPSJ-QS22005020.pdf","label":"IPSJ-QS22005020.pdf"},"date":[{"dateType":"Available","dateValue":"2024-03-17"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-QS22005020.pdf","filesize":[{"value":"767.4 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":"a5431d94-2b8e-4cf1-bc5e-eeb1180131e0","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":"Makoto, Nakai"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Rodney, Van Meter"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Makoto, Nakai","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Rodney, Van Meter","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":"Task allocation is one of the essential procedures in distributed computing and this will be also true for distributed quantum computing, which is a promising approach to achieve large-scale quantum computing. Total execution time and the stability in the entire system are the two main optimization criteria for this problem, but existing works for distributed qubit allocation only deal with the latter. This work proposes the heuristic algorithm to decide how each qubit on the given quantum circuit should be allocated on quantum processors with different execution time in order to minimize the total execution time. The performance of the proposed scheme is also evaluated by a simple numerical simulation.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Task allocation is one of the essential procedures in distributed computing and this will be also true for distributed quantum computing, which is a promising approach to achieve large-scale quantum computing. Total execution time and the stability in the entire system are the two main optimization criteria for this problem, but existing works for distributed qubit allocation only deal with the latter. This work proposes the heuristic algorithm to decide how each qubit on the given quantum circuit should be allocated on quantum processors with different execution time in order to minimize the total execution time. The performance of the proposed scheme is also evaluated by a simple numerical simulation.","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":"20","bibliographicVolumeNumber":"2022-QS-5"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":217642,"updated":"2025-01-19T15:25:51.753934+00:00","links":{},"created":"2025-01-19T01:18:07.878390+00:00"}