The quantum query complexity of the abelian hidden subgroup problem (Q2373740): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/tcs/KoiranNP07, #quickstatements; #temporary_batch_1731483406851 |
||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/tcs/KoiranNP07 / rank | |||
Normal rank |
Revision as of 09:03, 13 November 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
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
0 references