The quantum query complexity of the abelian hidden subgroup problem (Q2373740): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q59567887, #quickstatements; #temporary_batch_1707303357582 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59567887 / rank | |||
Normal rank | |||
Revision as of 15:12, 7 February 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
