%0 Journal Article
%J Phys. Rev. Lett.
%D 2007
%T N-representability is QMA-complete
%A Yi-Kai Liu
%A Matthias Christandl
%A F. Verstraete
%X We study the computational complexity of the N-representability problem in quantum chemistry. We show that this problem is quantum Merlin-Arthur complete, which is the quantum generalization of nondeterministic polynomial time 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.
%B Phys. Rev. Lett.
%V 98
%8 2007/03/16
%G eng
%U http://journals.aps.org/prl/abstract/10.1103/PhysRevLett.98.110503
%N 11
%R 10.1103/PhysRevLett.98.110503