The quantum query complexity of the abelian hidden subgroup problem (Q2373740): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2007.02.057 / 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
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
