Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables (Q294804)
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: Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables |
scientific article |
Statements
Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables (English)
0 references
16 June 2016
0 references
computational complexity
0 references
quantum computation
0 references
Boolean functions
0 references
sensitivity
0 references
0.8502299785614014
0 references
0.8289926648139954
0 references
0.8211318254470825
0 references
0.8147997856140137
0 references
0.8142812848091125
0 references
