The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\) (Q2018136)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The commuting local Hamiltonian problem on locally expanding graphs is approximable in NP |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\) |
scientific article |
Statements
The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\) (English)
0 references
13 April 2015
0 references
local Hamiltonian
0 references
PCP
0 references
quantum PCP
0 references
approximation
0 references
commuting local Hamiltonian
0 references
0 references
0 references
0.8029492497444153
0 references
0.802791178226471
0 references
0.8002771139144897
0 references
0.7990649938583374
0 references
0.7908305525779724
0 references
