Complexity Classification of Local Hamiltonian Problems

@article{Cubitt2014ComplexityCO,
title={Complexity Classification of Local Hamiltonian Problems},
author={T. Cubitt and A. Montanaro},
journal={2014 IEEE 55th Annual Symposium on Foundations of Computer Science},
year={2014},
pages={120-129}
}

2014 IEEE 55th Annual Symposium on Foundations of Computer Science

The calculation of ground-state energies of physical systems can be formalised as the k-local Hamiltonian problem, which is the natural quantum analogue of classical constraint satisfaction problems. One way of making the problem more physically meaningful is to restrict the Hamiltonian in question by picking its terms from a fixed set S. Examples of such special cases are the Heisenberg and Ising models from condensed-matter physics. In this work we characterise the complexity of this problemâ€¦Â CONTINUE READING