How low can approximate degree and quantum query complexity be for total Boolean functions? (Q488052)
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: How low can approximate degree and quantum query complexity be for total Boolean functions? |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How low can approximate degree and quantum query complexity be for total Boolean functions? |
scientific article |
Statements
How low can approximate degree and quantum query complexity be for total Boolean functions? (English)
0 references
23 January 2015
0 references
quantum computing
0 references
quantum algorithms
0 references
Boolean functions
0 references
polynomial approximations
0 references
computational complexity
0 references
0.8667046427726746
0 references
0.8518553376197815
0 references
0.8502299785614014
0 references
0.8467658162117004
0 references
0.82219398021698
0 references
