A software package to construct polynomial sets over Z2Z2 for determining the output of quantum computations

A C# package is presented that allows a user for an input quantum circuit to generate a set of multivariate polynomials over the finite field Z2Z2 whose total number of solutions in Z2Z2 determines the output of the quantum computation defined by the circuit. The generated polynomial system can further be converted to the canonical Gröbner basis form which provides a universal algorithmic tool for counting the number of common roots of the polynomials.