Remove the label-symmetry assumption from quantum collision-finding lower bounds
Establish a space-preserving symmetrisation argument for arbitrary quantum algorithms solving collision finding in uniformly random functions, or prove the corresponding time-space tradeoff without imposing label symmetry, thereby extending the lower bound from label-symmetric algorithms to all quantum algorithms.
References
The main open problem is to remove the label-symmetry assumption. Because both the uniform input distribution and the collision success condition are invariant under range relabelling, it is difficult to imagine how treating particular labels asymmetrically could help. Nevertheless, the usual method of symmetrising an arbitrary algorithm stores a random permutation and can require $\Theta(N\log N)$ additional space, so it does not preserve the parameter that our lower bound tracks. A space-preserving symmetrisation argument, or a proof that avoids symmetry altogether, would extend the tradeoff to all algorithms.