In article solving quadratic congruences, it is shown how to use Hensel's lemma to iteratively construct solutions to to $x^2 \equiv a \pmod{p^k}$ from the solutions to $x^2 \equiv a \pmod{p}$. The case where $p=2$ is treated separately.
While the construction is elegant, it is a tad lengthy and its reliance on Hensel's lemma makes it a bit far from elementary number theory.
If we are only concerned with an existential proof (rather than a constructive one), can we simplify the proof? That is, is it possible to succinctly prove the following theorem without resort to Hensel's lemma?
For any prime $p$ and any $k \in \mathbb{N}$, if $x$ is a quadratic residue mod $p$, then it is a quadratic residue mod $p^k$.