Hardness of efficiently generating ground states in postselected quantum computation

• Item type: SIG Technical Reports(1)
• 公開日: 2021-06-24
• タイトル: Hardness of efficiently generating ground states in postselected quantum computation
• タイトル / 言語: en
• タイトル: Hardness of efficiently generating ground states in postselected quantum computation
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_18gh
• 資源タイプ: technical report
• 著者所属: NTTコミュニケーション科学基礎研究所
• 著者所属: NTTコミュニケーション科学基礎研究所
• 著者所属: NTTコミュニケーション科学基礎研究所
• 著者所属(英): en
• 著者所属(英): NTT Communication Science Laboratories
• 著者所属(英): en
• 著者所属(英): NTT Communication Science Laboratories
• 著者所属(英): en
• 著者所属(英): NTT Communication Science Laboratories
• 著者名: Yuki, Takeuchi; Yasuhiro, Takahashi; Seiichiro, Tani
• 著者名(英): Yuki, Takeuchi; Yasuhiro, Takahashi; Seiichiro, Tani
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: 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.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: 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.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA12894105
• 書誌情報: 量子ソフトウェア（QS）; 巻 2021-QS-3, 号 9, p. 1-6, 発行日 2021-06-24
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 2435-6492
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会