Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
computational complexity property
|
| gptkbp:appliesTo |
decision problems
|
| gptkbp:characterizedBy |
hardest problems in QMA
|
| gptkbp:defines |
A problem is QMA-complete if it is in QMA and every problem in QMA can be reduced to it in polynomial time.
|
| gptkbp:example |
Quantum 3-SAT
Quantum clique problem k-local Hamiltonian problem |
| gptkbp:firstDefined |
gptkb:Alexei_Kitaev
|
| https://www.w3.org/2000/01/rdf-schema#label |
QMA-completeness
|
| gptkbp:importantFor |
central to quantum computational complexity
|
| gptkbp:introducedIn |
2002
|
| gptkbp:reductionType |
polynomial-time reduction
|
| gptkbp:relatedTo |
gptkb:NP-completeness
QMA (Quantum Merlin Arthur) |
| gptkbp:similarTo |
gptkb:NP-completeness
|
| gptkbp:usedIn |
quantum complexity theory
|
| gptkbp:bfsParent |
gptkb:Quantum_Computational_Complexity
|
| gptkbp:bfsLayer |
7
|