The quantum query complexity of the hidden subgroup problem is polynomial (Q2390280)

From MaRDI portal
Revision as of 23:10, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The quantum query complexity of the hidden subgroup problem is polynomial
scientific article

    Statements

    The quantum query complexity of the hidden subgroup problem is polynomial (English)
    0 references
    0 references
    0 references
    0 references
    21 July 2009
    0 references
    algorithms
    0 references
    quantum computation
    0 references
    hidden subgroups
    0 references
    query complexity
    0 references

    Identifiers