N-representability is QMA-complete

Details N-representability is QMA-complete N-representability is QMA-complete

2006-09-17

arxiv.org/abs/quant-ph/0609125v1

Phys. Rev. Lett. 98, 110503 (2007)

Physics

Quantum Physics

Scientific paper

10.1103/PhysRevLett.98.110503

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.

Affiliated with

Also associated with

No associations

Rating

N-representability is QMA-complete does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with N-representability is QMA-complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and N-representability is QMA-complete will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-704785