  We propose a quantum algorithm to solve systems of nonlinear algebraic
equations. In the ideal case the complexity of the algorithm is linear in the
number of variables $n$, which means our algorithm's complexity is less than
$O(n^{3})$ of the corresponding classical ones when the set of equations has
many variables and not so high orders. Different with most popular way of
representing the results by state vector, we get the results in computation
basis which is readable directly.
