Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure (Q2826061)

From MaRDI portal
Revision as of 17:15, 12 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
Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure
scientific article

    Statements

    Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure (English)
    0 references
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    0 references
    NAND tree
    0 references
    span programs
    0 references
    super-polynomial quantum speed-up
    0 references
    0 references
    0 references