TY - JOUR
T1 - N-representability is QMA-complete
JF - Phys. Rev. Lett.
Y1 - 2007
A1 - Yi-Kai Liu
A1 - Matthias Christandl
A1 - F. Verstraete
AB - 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.
VL - 98
UR - http://journals.aps.org/prl/abstract/10.1103/PhysRevLett.98.110503
CP - 11
U5 - 10.1103/PhysRevLett.98.110503
ER -
TY - JOUR
T1 - Asymptotic entanglement capacity of the Ising and anisotropic Heisenberg interactions
Y1 - 2002
A1 - A. M. Childs
A1 - D. W. Leung
A1 - F. Verstraete
A1 - G. Vidal
AB - We compute the asymptotic entanglement capacity of the Ising interaction ZZ, the anisotropic Heisenberg interaction XX + YY, and more generally, any two-qubit Hamiltonian with canonical form K = a XX + b YY. We also describe an entanglement assisted classical communication protocol using the Hamiltonian K with rate equal to the asymptotic entanglement capacity.
UR - http://arxiv.org/abs/quant-ph/0207052v2
J1 - Quantum Information and Computation 3
ER -