The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\) (Q2018136)

From MaRDI portal
Revision as of 23:19, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references