The quantum query complexity of the hidden subgroup problem is polynomial (Q2390280)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The quantum query complexity of the hidden subgroup problem is polynomial |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8687702417373657
0 references
0.8666919469833374
0 references
0.8636367917060852
0 references
0.8608761429786682
0 references
0.8589791059494019
0 references
