2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/125800We 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.Quantum Physicstext