The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5140844)
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 polynomial method strikes back: tight quantum query bounds via dual polynomials |
scientific article; zbMATH DE number 7286920
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The polynomial method strikes back: tight quantum query bounds via dual polynomials |
scientific article; zbMATH DE number 7286920 |
Statements
17 December 2020
0 references
polynomial method
0 references
quantum query complexity
0 references
dual polynomials
0 references
surjectivity
0 references
0 references
0 references
0.9946249723434448
0 references
0.9083123207092284
0 references
0.9057572484016418
0 references
0.8467658162117004
0 references
