It's not as sensational as the other answers, but there's a genuine, mathematically sound argument to be made that the answer is simply
No.
The distance $d_{you}$ you've traveled after $n$ turns is $d_{you} = n^2$, and the distance $d_{me}$ I've traveled is $d_{me} = n$.
Using big-O notation, $O(n^2)$ grows faster than $O(n)$, meaning I will never catch you.
One important thing to note that the accepted answer fails to account for:
While $\sum_{n=1}^{\infty} n^2$ and $\sum_{n=1}^{\infty} n$ are both equal to $-\frac{1}{2}$ based on certain mathematical arguments, the naive approaches that argue that they both grow without bound are still valid in other contexts - and I would argue those contexts are the ones that apply to our puzzle here. See the Wikipedia articles (https://en.wikipedia.org/wiki/1_%2B_2_%2B_4_%2B_8_%2B_%E2%8B%AF and https://en.wikipedia.org/wiki/1_%2B_1_%2B_1_%2B_1_%2B_%E2%8B%AF), which say: "Therefore, any totally regular summation method [for $\sum_{n=1}^{\infty} n^2$] gives a sum of infinity," and, "In the context of the extended real number line, $\sum_{n=1}^{\infty} n = \infty$, since its sequence of partial sums increases monotonically without bound."
The reason this is the more appropriate way to approach the puzzle is
At any given moment in our game, we'll have only played for a finite amount of time. The game will continue without end forever, but the amount of time we'll have played at any moment is arbitrarily large, which is not the same thing as infinite. This puzzle and this Math.SE question I asked a few years ago explore the distinction and show some of its consequences.