Title of article
A software package to construct polynomial sets over for determining the output of quantum computations
Author/Authors
Gerdt، نويسنده , , Vladimir P. and Severyanov، نويسنده , , Vasily M.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
5
From page
260
To page
264
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 Grِbner basis form which provides a universal algorithmic tool for counting the number of common roots of the polynomials.
Keywords
Polynomial equations , Grِbner basis , Quantum computation , Sum-over-paths
Journal title
Nuclear Instruments and Methods in Physics Research Section A
Serial Year
2006
Journal title
Nuclear Instruments and Methods in Physics Research Section A
Record number
2199941
Link To Document