{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00211784","sets":["1164:10193:10565:10617"]},"path":["10617"],"owner":"44499","recid":"211784","title":["Hardness of efficiently generating ground states in postselected quantum computation"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-06-24"},"_buckets":{"deposit":"a064f958-e407-4ead-a0a6-80ed0963f60a"},"_deposit":{"id":"211784","pid":{"type":"depid","value":"211784","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Hardness of efficiently generating ground states in postselected quantum computation","author_link":["538710","538713","538708","538709","538711","538712"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Hardness of efficiently generating ground states in postselected quantum computation"},{"subitem_title":"Hardness of efficiently generating ground states in postselected quantum computation","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2021-06-24","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"NTTコミュニケーション科学基礎研究所"},{"subitem_text_value":"NTTコミュニケーション科学基礎研究所"},{"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":"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/211784/files/IPSJ-QS21003009.pdf","label":"IPSJ-QS21003009.pdf"},"date":[{"dateType":"Available","dateValue":"2023-06-24"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-QS21003009.pdf","filesize":[{"value":"788.2 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":"4c543f50-dab4-47f8-b2ec-a5b7488197c3","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 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":"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":"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":"Generating ground states of any local Hamiltonians seems to be impossible in quantum polynomial time. In this talk, we give evidence for the impossibility by applying an argument used in the quantum-computational-supremacy approach. More precisely, we show that if ground states of any 3-local Hamiltonians can be approximately generated in quantum polynomial time with postselection, then PP = PSPACE. Our result is superior to the existing findings in the sense that we reduce the impossibility to an unlikely relation between classical complexity classes.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Generating ground states of any local Hamiltonians seems to be impossible in quantum polynomial time. In this talk, we give evidence for the impossibility by applying an argument used in the quantum-computational-supremacy approach. More precisely, we show that if ground states of any 3-local Hamiltonians can be approximately generated in quantum polynomial time with postselection, then PP = PSPACE. Our result is superior to the existing findings in the sense that we reduce the impossibility to an unlikely relation between classical complexity classes.","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":"2021-06-24","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicVolumeNumber":"2021-QS-3"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T17:40:42.837174+00:00","created":"2025-01-19T01:12:55.163019+00:00","id":211784}