The quantum query complexity of the abelian hidden subgroup problem (Q2373740): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2007.02.057 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q59567887 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092946121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds for the collision and the element distinctness problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quantum query complexity of the hidden subgroup problem is polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithms and the Fourier transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quantum query complexity of the abelian hidden subgroup problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of finite groups. An introduction. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degree of Boolean functions as real polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Quantum Computation / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/KoiranNP07 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2007.02.057 / rank
 
Normal rank

Latest revision as of 06:31, 18 December 2024

scientific article
Language Label Description Also known as
English
The quantum query complexity of the abelian hidden subgroup problem
scientific article

    Statements

    The quantum query complexity of the abelian hidden subgroup problem (English)
    0 references
    0 references
    0 references
    0 references
    16 July 2007
    0 references
    quantum computing
    0 references
    query complexity
    0 references
    lower bounds
    0 references
    polynomial method
    0 references
    hidden subgroup problems
    0 references
    Simon's problem
    0 references

    Identifiers