N-representability is QMA-complete
Quantum Physics
2007-05-23 v1
Abstract
We study the computational complexity of the N-representability problem in quantum chemistry. We show that this problem is QMA-complete, which is the quantum generalization of NP-complete. Our proof uses a simple mapping from spin systems to fermionic systems, as well as a convex optimization technique that reduces the problem of finding ground states to N-representability.
Cite
@article{arxiv.quant-ph/0609125,
title = {N-representability is QMA-complete},
author = {Y. -K. Liu and M. Christandl and F. Verstraete},
journal= {arXiv preprint arXiv:quant-ph/0609125},
year = {2007}
}