N-representability is QMA-complete

Simple item page
dc.creatorLiu, Y. -K.
dc.creatorChristandl, M.
dc.creatorVerstraete, F.
dc.date2006-09-17
dc.date.accessioned2026-07-07T07:52:13Z
dc.date.available2026-07-07T07:52:13Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/quant-ph/0609125
dc.identifierhttp://arxiv.org/abs/quant-ph/0609125
dc.identifierPhys. Rev. Lett. 98, 110503 (2007)
dc.identifierdoi:10.1103/PhysRevLett.98.110503
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/125800
dc.subjectQuantum Physics
dc.titleN-representability is QMA-complete
dc.typetext

Files

Collections

arXiv