Robust Polynomials and Quantum Algorithms
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).
Unable to display preview. Download preview PDF.
- 4.Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of 28th ACM STOC, pp. 212–219 (1996)Google Scholar
- 6.Iwama, K., Putra, R., Yamashita, S.: Quantum query complexity of biased oracles. Unpublished manuscript and talk at EQIS Conference (September 2003)Google Scholar