152 search results - page 1 / 31 » Robust Polynomials and Quantum Algorithms |
STACS
2005
Springer
13 years 10 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
CATS
2007
13 years 6 months ago
2007
d Abstract) Tomoyuki Yamakami Department of Computer Software, University of Aizu 90 Kami-Iawase, Tsuruga, Ikki-machi, Fukushima 965-8580, Japan Our task of quantum list decoding ...