Entangled Games Are Hard to Approximate (Q3093626)

From MaRDI portal
Revision as of 15:00, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Entangled Games Are Hard to Approximate
scientific article

    Statements

    title
    Entangled Games Are Hard to Approximate (English)
    0 references
    DOI
    10.1137/090751293
    0 references
    author
    Hirotada Kobayashi
    0 references
    Keiji Matsumoto
    0 references
    Ben Toner
    0 references
    Thomas Vidick
    0 references
    Julia Kempe
    0 references
    publication date
    18 October 2011
    0 references
    Mathematics Subject Classification ID
    81P68
    0 references
    68Q17
    0 references
    91A06
    0 references
    zbMATH DE Number
    5959909
    0 references
    zbMATH Keywords
    interactive proofs
    0 references
    quantum computing
    0 references
    entanglement
    0 references
    almost-commuting matrices
    0 references
    Wikidata QID
    Q56675303
    0 references
    OpenAlex ID
    W1997685871
    0 references
    arXiv ID
    0704.2903
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3093626&oldid=33597978"
    Powered by MediaWiki