Let $X,Y\sim Bin(n,p)$ be independent R.V.s and let $z\in[n]$ be integer. My goal is to approximate the probability that $P[X-Y=2z]$.
What i need is a tight enough bound with error that is at most $o(\sqrt{n})$. The best bound i seen using basically CLT gives error of exactly $O(\sqrt{n})$.
The best i could think of is the following sum expansion. But i have no real idea how to proceed from there. \begin{align} P[X-Y=2z] & =\sum_{i=0}^{n} P[X=i+z, Y=i-z] \\\\ & = \sum_{i=0}^{n} P[X=i+z] P[Y=i-z] \\\\ & = \sum_{i=0}^{n} \binom{n}{i+z} p^{i+z} (1-p)^{n-i-z} \binom{n}{i-z} p^{i-z} (1-p)^{n-i+z} \\\\ & = \sum_{i=0}^{n} \binom{n}{i+z} \binom{n}{i-z} p^{2i} (1-p)^{2n-2i} \end{align}
Any ideas how to continue from here?
For clarification i want to approximate this from above and from below. By the same term, and even the same constants, but with error of at most $o(\sqrt{n})$.
Edit: $p$ can be a constant or dependent on $n$ tending to zero as $n$ tends to infinity. For constant $p=1/2$ the question is easy to answer, but what about other cases?