Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure (Q2826061): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:40, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure |
scientific article |
Statements
Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure (English)
0 references
7 October 2016
0 references
NAND tree
0 references
span programs
0 references
super-polynomial quantum speed-up
0 references
