2026-05-12T03:40:22Z https://ipsj.ixsq.nii.ac.jp/oai

oai:ipsj.ixsq.nii.ac.jp:00211784 2025-01-19T17:40:42Z 1164:10193:10565:10617

Hardness of efficiently generating ground states in postselected quantum computation Hardness of efficiently generating ground states in postselected quantum computation Yuki, Takeuchi Yasuhiro, Takahashi Seiichiro, Tani Yuki, Takeuchi Yasuhiro, Takahashi Seiichiro, Tani 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. 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. 情報処理学会 2021-06-24 eng technical report https://ipsj.ixsq.nii.ac.jp/records/211784 2435-6492 AA12894105 量子ソフトウェア（QS） 2021-QS-3 9 1 6 https://ipsj.ixsq.nii.ac.jp/record/211784/files/IPSJ-QS21003009.pdf application/pdf 788.2 kB 2023-06-24