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 show that, in contrast to the classical model of Feige et al., every Boolean function can be computed by O(n) quantum queries even in the model with noise. This implies, for instance, the somewhat surprising result that every Boolean function has robust degree bounded by O(n).
|Number of pages||12|
|Journal||Lecture Notes in Computer Science|
|State||Published - 2005|
|Event||22nd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2005 - Stuttgart, Germany|
Duration: 24 Feb 2005 → 26 Feb 2005
ASJC Scopus subject areas
- Computer Science (miscellaneous)