Super-polynomial quantum speed-ups for Boolean evaluation trees with hidden structure (Q2826061)
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: Super-polynomial quantum speed-ups for Boolean evaluation trees with hidden structure |
scientific article; zbMATH DE number 6636350
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Super-polynomial quantum speed-ups for Boolean evaluation trees with hidden structure |
scientific article; zbMATH DE number 6636350 |
Statements
7 October 2016
0 references
NAND tree
0 references
span programs
0 references
super-polynomial quantum speed-up
0 references
Super-polynomial quantum speed-ups for Boolean evaluation trees with hidden structure (English)
0 references
