Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
conjecture
|
| gptkbp:category |
gptkb:quantum_information_theory
theoretical computer science |
| gptkbp:field |
quantum complexity theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
quantum PCP theorem
|
| gptkbp:implies |
quantum error correction
quantum many-body physics quantum computational complexity |
| gptkbp:influencedBy |
classical PCP theorem
|
| gptkbp:notableContributor |
gptkb:Dorit_Aharonov
gptkb:Aram_Harrow gptkb:Umesh_Vazirani gptkb:Oded_Regev Itai Arad Thomas Vidick |
| gptkbp:proposedBy |
2006
QMA-hardness of approximating ground state energy of local Hamiltonians |
| gptkbp:relatedTo |
gptkb:PCP_theorem
quantum Hamiltonian complexity |
| gptkbp:status |
open problem
|
| gptkbp:type |
Is it QMA-hard to approximate the ground state energy of a local Hamiltonian to within a constant additive error?
|
| gptkbp:bfsParent |
gptkb:Quantum_Complexity_Theory
|
| gptkbp:bfsLayer |
7
|