An optimal separation of randomized and Quantum query complexity (Q6065253)
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: An optimal separation of randomized and Quantum query complexity |
scientific article; zbMATH DE number 7765249
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal separation of randomized and Quantum query complexity |
scientific article; zbMATH DE number 7765249 |
Statements
An optimal separation of randomized and Quantum query complexity (English)
0 references
14 November 2023
0 references
Fourier analysis of Boolean functions
0 references
Fourier weight of decision trees
0 references
communication complexity
0 references
forrelation
0 references
quantum-classical separations
0 references
query complexity
0 references
0.9966822266578674
0 references
0.8563868403434753
0 references
0.8316655158996582
0 references
