An exponential separation between quantum query complexity and the polynomial degree (Q6911409)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8110392
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exponential separation between quantum query complexity and the polynomial degree |
scientific article; zbMATH DE number 8110392 |
Statements
An exponential separation between quantum query complexity and the polynomial degree (English)
0 references
24 October 2025
0 references
quantum lower bounds
0 references
query complexity
0 references
polynomial method
0 references
quantum adversary bound
0 references
0 references
