|
| related topics |
| {state, algorithm, problem} |
| {states, state, optimal} |
| {operator, operators, space} |
| {algorithm, log, probability} |
| {state, states, entangled} |
| {temperature, thermal, energy} |
| {field, particle, equation} |
| {let, theorem, proof} |
| {observables, space, algebra} |
| {state, states, coherent} |
| {energy, state, states} |
| {qubit, qubits, gate} |
|
N-representability is QMA-complete
Y. -K. Liu, M. Christandl, F. Verstraete
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.
- oai_identifier:
- oai:arXiv.org:quant-ph/0609125
- categories:
- quant-ph
- doi:
- 10.1103/PhysRevLett.98.110503
- arxiv_id:
- quant-ph/0609125
- journal_ref:
- Phys. Rev. Lett. 98, 110503 (2007)
- created:
- 2006-09-17
Full article ▸
|
|
| related documents |
| 0204044v5 |
| 0303070v1 |
| 9702039v4 |
| 0506244v2 |
| 0502014v2 |
| 0105071v2 |
| 0411194v2 |
| 0702007v2 |
| 0612123v2 |
| 0702033v1 |
| 0701079v1 |
| 0608156v1 |
| 0701198v1 |
| 0612033v1 |
| 0703193v2 |
| 0612052v2 |
| 0610251v1 |
| 0702143v1 |
| 0701054v1 |
| 0610258v1 |
| 0702270v1 |
| 0609072v1 |
| 0608211v2 |
| 0702140v1 |
| 0609160v1 |
|