The Fundamental Theorem on Symmetric Polynomials, together with the Vieta's Formulas, give us the following conclusion:
For every symmetric polynomial $f \in \Bbb Q[X_1, \dots ,X_n]$ there is a polynomial $g \in \Bbb Q[X_1, \dots ,X_n]$ such that the polynomial identity (in $\overline{\mathbb{Q}}[t]$) $$a_0+a_1t+\cdots + a_{n-1}t^{n-1}+t^n = (t-x_1) \cdots (t-x_n)$$ implies $$f(x_1,...,x_n)=g(a_0,...,a_{n-1})$$
For example, if $f(X,Y)=X^2+Y^2$, then $$ t^2+ bt + c = (t-x_1) (t-x_2) \quad \Rightarrow \quad f(x_1,x_2) = b^2-2c$$ (To see this, note that $x_1^2 + x_2^2 = (x_1+x_2)^2 - 2x_1x_2$.) So $g(X,Y)= Y^2 - 2X$.
If our polynomial $f$ is not symmetric, there's still hope. For example, suppose $f \in \Bbb Q[X_1, \dots ,X_n]$ is anti-symmetric. Then $f \cdot f$ is a symmetric polynomial, and therefore there is a polynomial $\hat g \in \Bbb Q[X_1, \dots ,X_n]$ such that $$f(x_1,\dots,x_n) = \pm \sqrt{\hat g(a_0,...,a_{n-1})}$$ For example, if $f(X,Y) = X - Y$, then $$ t^2 + bt +c = (t-x_1)(t-x_2) \quad \Rightarrow \quad f(x_1,x_2)^2 = b^2-4c$$ (This follows by essentially the same argument as the previous example.)
Another way to say this is that, in the antisymmetric case, calculating $f(x_1,...,x_n)$ is still as hard as calculating the roots of the polynomial $t^2-\hat g(a_0,...,a_{n-1})\in\mathbb{Q}(\hat{g})[t]$.
So my question is: given a polynomial $f \in \Bbb Q[X_1, \dots ,X_n]$, can we determine if there is a polynomial $Q \in \Bbb Q[t]$ (of positive degree) such that $Q \circ f \in \mathbb{Q}[X_1, \dots ,X_n]$ is a symmetric polynomial? This would mean that calculating $f(x_1,...,x_n)$ is as hard as calculating the roots of $Q$.
---Edit: The Polynomial $f$ should have positive degree in each variable. i think it's a reasonable simplification of the problem to ask the polynomial $f$ to be homogeneous.