Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure (Q2826061): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1101.0796 / rank | |||
Normal rank | |||
Revision as of 09:44, 19 April 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
