Quantum algorithms for learning symmetric juntas via the adversary bound

Cited from the 19 Oct 2026 digest as the prior majority-junta bound. The preprint states an upper bound on the order of k to the power 1/4 for identifying the variables of a majority junta. Krivcenko, Nguyen, and de Wolf say their logarithmic query algorithm answers an open question in Section 8 of Belovs's later journal version. This record points at the preprint whose abstract states the one-fourth bound.