In an attempt to show that the acceptance probability of a quantum query algorithm making q queries can be well-approximated almost everywhere by a classical decision tree of depth \leq \text{poly}(q), Aaronson and Ambainis proposed the following conjecture: let f: \{ \pm 1\}^n \rightarrow [0,1] be a degree d polynomial ... more >>>