Robust polynomials and quantum algorithms

Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald De Wolf

Research output: Contribution to journalConference articlepeer-review


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).

Original languageEnglish
Pages (from-to)593-604
Number of pages12
JournalLecture Notes in Computer Science
StatePublished - 2005
Event22nd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2005 - Stuttgart, Germany
Duration: 24 Feb 200526 Feb 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Robust polynomials and quantum algorithms'. Together they form a unique fingerprint.

Cite this