2-Local Hamiltonian with Low Complexity is QCMA
Computational Complexity
2019-09-10 v1 Quantum Physics
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.
Cite
@article{arxiv.1909.03787,
title = {2-Local Hamiltonian with Low Complexity is QCMA},
author = {Ying-hao Chen},
journal= {arXiv preprint arXiv:1909.03787},
year = {2019}
}
Comments
A Class project Paper for CS395T Quantum Complexity Theory at UT Austin in Spring 2019 under Professor Scott Aaronson