Start with the Cholesky decomposition. That is, for any such $A$, we have an $L$ such that $LL^* = A$. Now, in the case that $k>n$, construct the $n\times k$ block matrix $X$ as follows:
$$
X =
\begin{bmatrix}
L & 0
\end{bmatrix}
$$
Where $0$ here is the $n\times(k-n)$ zero matrix. We find that
$$
XX^* =
\begin{bmatrix}
L & 0
\end{bmatrix}
\begin{bmatrix}
L^* \\ 0^*
\end{bmatrix}= LL^* + 00^* = LL^* = A
$$
This will not generally be possible in the case that $k<n$. For a given symmetric, positive semidefinite matrix $A$, if $XX^* = A$ and $X$ is $n\times k$, then $k$ must be greater than or equal to the rank of $A$.