dorsal/arxiv
View SchemaN-representability is QMA-complete
| Authors | Y. -K. Liu, M. Christandl, F. Verstraete |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0609125 |
| URL | https://arxiv.org/abs/quant-ph/0609125 |
| DOI | 10.1103/PhysRevLett.98.110503 |
| Journal | Phys. Rev. Lett. 98, 110503 (2007) |
Abstract
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.
{
"annotation_id": "89af5ba4-79b6-409d-a425-ee1c794d1671",
"date_created": "2026-03-02T18:02:30.423000Z",
"date_modified": "2026-03-02T18:02:30.423000Z",
"file_hash": "f989d8fe2db987f6d3a7f2575ebce2fed16ab589958b15f2c9ecba5c79ad66ba",
"private": false,
"record": {
"abstract": "We study the computational complexity of the N-representability problem in\nquantum chemistry. We show that this problem is QMA-complete, which is the\nquantum generalization of NP-complete. Our proof uses a simple mapping from\nspin systems to fermionic systems, as well as a convex optimization technique\nthat reduces the problem of finding ground states to N-representability.",
"arxiv_id": "quant-ph/0609125",
"authors": [
"Y. -K. Liu",
"M. Christandl",
"F. Verstraete"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevLett.98.110503",
"journal_ref": "Phys. Rev. Lett. 98, 110503 (2007)",
"title": "N-representability is QMA-complete",
"url": "https://arxiv.org/abs/quant-ph/0609125"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "ca4d0287-d656-4067-a908-42e737620ca8",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}