Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:category |
open problem in mathematics
open problem in quantum computing |
| gptkbp:field |
theoretical computer science
quantum complexity theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Quantum PCP conjecture
|
| gptkbp:implies |
quantum error correction
quantum many-body physics quantum complexity theory hardness of approximation for quantum problems |
| gptkbp:influencedBy |
classical PCP theorem
|
| gptkbp:proposedBy |
gptkb:Dorit_Aharonov
gptkb:Umesh_Vazirani 2006 Itai Arad Thomas Vidick |
| gptkbp:relatedTo |
gptkb:PCP_theorem
quantum Hamiltonian complexity |
| gptkbp:state |
Approximating the ground state energy of local quantum Hamiltonians is QMA-hard even to constant relative error
|
| gptkbp:status |
open
|
| gptkbp:bfsParent |
gptkb:Quantum_Computational_Complexity
|
| gptkbp:bfsLayer |
7
|