{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00225065","sets":["1164:10193:11168:11169"]},"path":["11169"],"owner":"44499","recid":"225065","title":["Connecting Quantum Systems with Classical Wires"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-03-06"},"_buckets":{"deposit":"919e3a85-6556-4480-831a-c0aa47a6ec9c"},"_deposit":{"id":"225065","pid":{"type":"depid","value":"225065","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Connecting Quantum Systems with Classical Wires","author_link":["594869","594866","594867","594868","594865","594864"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Connecting Quantum Systems with Classical Wires"},{"subitem_title":"Connecting Quantum Systems with Classical Wires","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2023-03-06","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Applied Physics and Physico-Informatics, Keio University"},{"subitem_text_value":"Department of Applied Physics and Physico-Informatics, Keio University"},{"subitem_text_value":"Department of Applied Physics and Physico-Informatics, Keio University／Quantum Computing Center, Keio University"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Applied Physics and Physico-Informatics, Keio University","subitem_text_language":"en"},{"subitem_text_value":"Department of Applied Physics and Physico-Informatics, Keio University","subitem_text_language":"en"},{"subitem_text_value":"Department of Applied Physics and Physico-Informatics, Keio University / Quantum Computing Center, Keio University","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/225065/files/IPSJ-QS23008029.pdf","label":"IPSJ-QS23008029.pdf"},"date":[{"dateType":"Available","dateValue":"2025-03-06"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-QS23008029.pdf","filesize":[{"value":"835.5 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":"fb951a3b-5575-4b7f-995f-43847ff8240a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hiroyuki, Harada"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kaito, Wada"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Naoki, Yamamoto"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hiroyuki, Harada","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kaito, Wada","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Naoki, Yamamoto","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":"To overcome the limitation of the quality and quantity of qubits in currenet quantum devices, quantum circuit cutting technique has been proposed. This techniques take a strategy to cut a quantum circuit, enabling us to execute quantum simulations requiring more qubits than physically available. Although this method is appealing, there is a problem that the sampling cost grows exponentially with the number of cuts, so it is important to pursue decomposition methods with small sampling costs. In this work, we propose a method of decomposing a single-qubit identity channel, which achieves a optimal sampling costs without any ancilla qubits. Furthermore, we give optimal decomposition of a n-qubit parallel identity channels. While recent studies have shown that the use of a pre-shared Bell pairs allows for optimal decomposition of n-qubit parallel identity channels, our method does not require that resources but achieve the same sampling costs.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"To overcome the limitation of the quality and quantity of qubits in currenet quantum devices, quantum circuit cutting technique has been proposed. This techniques take a strategy to cut a quantum circuit, enabling us to execute quantum simulations requiring more qubits than physically available. Although this method is appealing, there is a problem that the sampling cost grows exponentially with the number of cuts, so it is important to pursue decomposition methods with small sampling costs. In this work, we propose a method of decomposing a single-qubit identity channel, which achieves a optimal sampling costs without any ancilla qubits. Furthermore, we give optimal decomposition of a n-qubit parallel identity channels. While recent studies have shown that the use of a pre-shared Bell pairs allows for optimal decomposition of n-qubit parallel identity channels, our method does not require that resources but achieve the same sampling costs.","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":"2023-03-06","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"29","bibliographicVolumeNumber":"2023-QS-8"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:24:34.836147+00:00","updated":"2025-01-19T12:56:18.478778+00:00","id":225065}