Quantum Query Complexity of the Hyperoctahedral Group

Abstract

We determine the quantum query complexity of oracle identification on the hyperoctahedral group $B_N = \{\pm 1\}^N \rtimes S_N$ with respect to the natural representation: $Q_{LV}(B_N) = 2(N-1)$ for all $N \ge 2$. This is twice the symmetric-group value $Q_{LV}(S_N) = N-1$; the doubling arises from an $\varepsilon$-parity obstruction that restricts the bottleneck representation $\operatorname{sgn}(σ)$ to even tensor powers. The proof combines a reduction to $S_N$ Kronecker products via Rademacher moment polynomials with the bipartition distance formula $d_T(((N),\varnothing),(α,β)) = 2(N-α_1)-|β|$ in the tensor product graph. A closed-form generating function yields the first-appearance multiplicity $(2N-3)!!$. We also show $Q_{\mathrm{decomp}}(φ) \le 2\,Q_{\mathrm{signed}}(φ)$, with equality on $B_2$, and conjecture a link between the adversary bound and the graph eccentricity.