How low can approximate degree and quantum query complexity be for total Boolean functions? (Q488052)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
