{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00217627","sets":["1164:10193:10905:10906"]},"path":["10906"],"owner":"44499","recid":"217627","title":["Divide-and-conquer verification method for noisy intermediate-scale quantum computation"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-03-17"},"_buckets":{"deposit":"626f6802-bbab-419b-bda7-bf0a9a128d85"},"_deposit":{"id":"217627","pid":{"type":"depid","value":"217627","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Divide-and-conquer verification method for noisy intermediate-scale quantum computation","author_link":["564164","564170","564169","564165","564166","564171","564167","564168"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Divide-and-conquer verification method for noisy intermediate-scale quantum computation"},{"subitem_title":"Divide-and-conquer verification method for noisy intermediate-scale quantum computation","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":"NTTコミュニケーション科学基礎研究所"},{"subitem_text_value":"NTTコミュニケーション科学基礎研究所"},{"subitem_text_value":"京都大学"},{"subitem_text_value":"NTTコミュニケーション科学基礎研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"NTT Communication Science Laboratories","subitem_text_language":"en"},{"subitem_text_value":"NTT Communication Science Laboratories","subitem_text_language":"en"},{"subitem_text_value":"Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"NTT Communication Science Laboratories","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/217627/files/IPSJ-QS22005005.pdf","label":"IPSJ-QS22005005.pdf"},"date":[{"dateType":"Available","dateValue":"2024-03-17"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-QS22005005.pdf","filesize":[{"value":"863.8 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":"3ceefb3d-eff3-4ed2-af4d-5dda1af23354","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":"Yuki, Takeuchi"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yasuhiro, Takahashi"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tomoyuki, Morimae"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Seiichiro, Tani"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yuki, Takeuchi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yasuhiro, Takahashi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tomoyuki, Morimae","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Seiichiro, Tani","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":"Several noisy intermediate-scale quantum computations can be regarded as logarithmic-depth quantum circuits on a sparse quantum computing chip, where two-qubit gates can be directly applied on only some pairs of qubits. In this talk, we propose a method to efficiently verify such noisy intermediate-scale quantum computation. To this end, we first characterize small-scale quantum operations with respect to the diamond norm. Then by using these characterized quantum operations, we estimate the fidelity <ψt","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Several noisy intermediate-scale quantum computations can be regarded as logarithmic-depth quantum circuits on a sparse quantum computing chip, where two-qubit gates can be directly applied on only some pairs of qubits. In this talk, we propose a method to efficiently verify such noisy intermediate-scale quantum computation. To this end, we first characterize small-scale quantum operations with respect to the diamond norm. Then by using these characterized quantum operations, we estimate the fidelity <ψt","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"量子ソフトウェア（QS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-03-17","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"2022-QS-5"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":217627,"updated":"2025-01-19T15:26:16.613141+00:00","links":{},"created":"2025-01-19T01:18:07.004878+00:00"}