Quantum Query Algorithms are Completely Bounded Forms. (Q4993266)

From MaRDI portal
Revision as of 10:05, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7359340
Language Label Description Also known as
English
Quantum Query Algorithms are Completely Bounded Forms.
scientific article; zbMATH DE number 7359340

    Statements

    0 references
    0 references
    0 references
    15 June 2021
    0 references
    0 references
    quantum query algorithms
    0 references
    operator space theory
    0 references
    polynomial method
    0 references
    approximate degree.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Quantum Query Algorithms are Completely Bounded Forms. (English)
    0 references