A Software Package to Construct Polynomial Sets over Z_2 for Determining the Output of Quantum Computations
arXiv:quant-ph/0509064 · doi:10.1016/j.nima.2005.11.147
Abstract
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 Z_2 whose total number of solutions in Z_2 determines the output of the quantum computation defined by the circuit. The generated polynomial system can further be converted to the canonical Groebner basis form which provides a universal algorithmic tool for counting the number of common roots of the polynomials.
5 pages, 4 Postscript figures, report presented on ACAT 2005