  In the claw detection problem we are given two functions $f:D\rightarrow R$
and $g:D\rightarrow R$ ($|D|=n$, $|R|=k$), and we have to determine if there is
exist $x,y\in D$ such that $f(x)=g(y)$. We show that the quantum query
complexity of this problem is between $\Omega\left(n^{1/2}k^{1/6}\right)$ and
$O\left(n^{1/2+\varepsilon}k^{1/4}\right)$ when $2\leq k<n$.
