The quantum query complexity of the abelian hidden subgroup problem (Q2373740)
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 abelian hidden subgroup problem |
scientific article; zbMATH DE number 5171357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The quantum query complexity of the abelian hidden subgroup problem |
scientific article; zbMATH DE number 5171357 |
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
0.9350904
0 references
0.9347733
0 references
0.9304861
0 references
0.9237303
0 references
0.9128492
0 references
0.9103671
0 references
0.9090942
0 references
0.9090942
0 references
0.9021003
0 references
0.89696145
0 references
