Define algebraic number tuple as the aphabetical order sequence of variables that use in the equation. How many algebraic number n-tuple (x,y,z,...) are able to genereate zero to input into a several variable diophaine equation that use integer power?
For example: $x^6y^9z^2+yx+5$=0 is such a equation
related question: How does Hilbert's Nullstellensatz generalize the "fundamental theorem of algebra"?
I'm going to first interpret your question:
"Can you describe the set of $n$-tuples of real numbers $(a_1, a_2, \dots , a_n)$ such that there's some polynomial with rational coefficients $f \in \Bbb Q[x_1, \dots , x_n]$ with $f(a_1, \dots , a_n) = 0$?"
For the $n=1$ case, you get the algebraic numbers. These are precisely the real numbers that are the roots of some polynomial with rational coefficients. If I'm to interpret "how many" as the cardinality of this set, the algebraic numbers are countable.
For $n \geq 2$ you (essentially) recover the concept of algebraic independence of real numbers over the rationals. I'll focus on the $n=2$ case.
Questions about your set lie firmly in the field of transcendental number theory. You might be interested in the various things linked in that Wikipedia article.