Any AND-OR Formula of Size <i>N</i> Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer (Q3068642)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Any AND-OR Formula of Size <i>N</i> Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer |
scientific article |
Statements
Any AND-OR Formula of Size <i>N</i> Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer (English)
0 references
17 January 2011
0 references
quantum computation
0 references
quantum query complexity
0 references
formula evaluation
0 references
AND-OR trees
0 references
quantum walk
0 references
