2000 character limit reached
2-Local Hamiltonian with Low Complexity is QCMA (1909.03787v1)
Published 6 Sep 2019 in cs.CC and quant-ph
Abstract: We prove that 2-Local Hamiltonian (2-LH) with Low Complexity problem is QCMA-complete by combining the results from the QMA-completeness[4] of 2-LH and QCMA-completeness of 3-LH with Low Complexity[6]. The idea is straightforward. It has been known that 2-LH is QMA-complete. By putting a low complexity constraint on the input state, we make the problem QCMA. Finally, we use similar arguments as in [4] to show that all QCMA problems can be reduced to our proposed problem.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.