Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function (Q5171199)
From MaRDI portal
scientific article; zbMATH DE number 6321497
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function |
scientific article; zbMATH DE number 6321497 |
Statements
Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function (English)
0 references
25 July 2014
0 references
