A lower bound on the quantum query complexity of read-once functions (Q1880783)

From MaRDI portal
Revision as of 18:29, 19 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q62117306, #quickstatements; #temporary_batch_1710865376617)
scientific article
Language Label Description Also known as
English
A lower bound on the quantum query complexity of read-once functions
scientific article

    Statements

    A lower bound on the quantum query complexity of read-once functions (English)
    0 references
    0 references
    0 references
    1 October 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Quantum query complexity
    0 references
    Quantum computation
    0 references
    Query complexity
    0 references
    Decision tree complexity
    0 references
    Read-once functions
    0 references
    Lower bounds
    0 references
    0 references