Reduce comparision Points using kdtree python

I have a simple python function with two arrays(P and Q). The function loops through all points from P and Q, so total computation is (P*Q). I want to reduce this computation using kdtree and make the code faster.