We give an exposition of a recent proof of the Aaronson-Ambainis conjecture, which states that every degree-$d$ polynomial $p : \{0,1\}^n \to [0,1]$ has a variable of influence at least $\mathrm{poly}(\mathrm{Var}(p)/d)$. This implies that quantum query algorithms for decision problems can be efficiently simulated clas...
Guy Blanc, Jordan Docter, Carmen Strassle et al.· 0 citations
The notion of meta-complexity of quantum relativization of oracles is introduced, and it is shown that this meta-complexity can be nontrivial by giving a complete classification, within the family of oracle pantheons defined in this paper, of which models can separate the complexity classes.
S. Aaronson, Adam Bouland, Jordan Docter et al.· arXiv.org· 0 citations
We study how quantum encodings and symmetry-adapted measurements preserve information for planted-clique detection from one classical graph. For $k=\lfloor n^{1/2-\varepsilon}\rfloor$, with fixed $0<\varepsilon<1/2$, detection is statistically possible but conjectured hard for polynomial-time classical algorithms. For...
Vojtěch Havlíček, Jordan Docter, Subhash Khot· arXiv.org· 0 citations
This work settles this conjecture for parallel quantum algorithms, showing that every $t-query $d-round quantum algorithm can be simulated on most inputs with $t^{O(d^2)}$ classical queries, suggesting that for unstructured problems, superpolynomial speedups would require quantum circuits of superconstant depth, and ex...
Guy Blanc, Jordan Docter, Carmen Strassle et al.· 2 citations· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.