Given a symmetric matrix $B \in \mathbb{C}^{n\times n}$.
How many coefficients of $A \in \mathbb{C}^{n\times n}$ can you obtain from the following equation? $$A^\top A=B$$
I think this problem is under determined? Isn't it? Sure $B$ must be symmetric. Thus only $\frac{n(n+1)}{2}$ complex equations remain for $n\times n$ coefficients.
Not completely sure about complex numbers, but... If $A^\top A=B$ then, $B$ is symmetric positive semi-definite. So you can take the eigenvalue/vector decomposition of $B$, such that $B=U\Lambda U^\top$. Then $A=(U\Lambda^{1/2})^\top$.