The quantum query complexity of the hidden subgroup problem is polynomial (Q2390280): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/ipl/EttingerHK04, #quickstatements; #temporary_batch_1731547958265 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/ipl/EttingerHK04 / rank | |||
Normal rank | |||
Latest revision as of 02:59, 14 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The quantum query complexity of the hidden subgroup problem is polynomial |
scientific article |
Statements
The quantum query complexity of the hidden subgroup problem is polynomial (English)
0 references
21 July 2009
0 references
algorithms
0 references
quantum computation
0 references
hidden subgroups
0 references
query complexity
0 references
0 references
