A Software Package to Construct Polynomial Sets over Z2 for Determining the Output of Quantum Computations
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 Z2 whose total number of solutions in Z2 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.