Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275)

From MaRDI portal
Revision as of 21:10, 12 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128722761, #quickstatements; #temporary_batch_1723488958199)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6995730
Language Label Description Also known as
English
Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness
scientific article; zbMATH DE number 6995730

    Statements

    title
    Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (English)
    0 references
    DOI
    10.1137/16M1061400
    0 references
    author
    Mark Braverman
    0 references
    Ankit Garg
    0 references
    Young Kun-Ko
    0 references
    Jieming Mao
    0 references
    Dave Touchette
    0 references
    publication date
    19 December 2018
    0 references
    zbMATH DE Number
    6995730
    0 references
    zbMATH Keywords
    disjointness
    0 references
    quantum communication complexity
    0 references
    quantum information complexity
    0 references
    arXiv ID
    1505.03110
    0 references
    cites work
    Q3002757
    0 references
    Q4542521
    0 references
    Q4939137
    0 references
    Q4228473
    0 references
    Q4258580
    0 references
    Q3549688
    0 references
    Some Minimax Theorems.
    0 references
    OpenAlex ID
    W2905051967
    0 references
    Wikidata QID
    Q128722761
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4562275&oldid=37584200"
    Powered by MediaWiki