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

From MaRDI portal
Revision as of 02:59, 14 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/ipl/EttingerHK04, #quickstatements; #temporary_batch_1731547958265)
(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

    title
    The quantum query complexity of the hidden subgroup problem is polynomial (English)
    0 references
    author
    Mark Ettinger
    0 references
    Peter Høyer
    0 references
    Emanuel Knill
    0 references
    publication date
    21 July 2009
    0 references
    zbMATH Keywords
    algorithms
    0 references
    quantum computation
    0 references
    hidden subgroups
    0 references
    query complexity
    0 references

    Identifiers

    zbMATH DE Number
    5581151
    0 references
    OpenAlex ID
    W2044747430
    0 references
    Wikidata QID
    Q62039263
    0 references
    arXiv ID
    quant-ph/0401083
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2390280&oldid=37913972"
    Powered by MediaWiki