3 citations · 4 across the 2 of their papers we have counts for
2 papers
quant-ph2005★ 3 cited
An Algorithm for Constructing Polynomial Systems Whose Solution Space Characterizes Quantum Circuits
Vladimir P. Gerdt, Vasily M. Severyanov
An algorithm and its first implementation in C# are presented for assembling arbitrary quantum circuits on the base of Hadamard and Toffoli gates and for constructing multivariate…
quant-ph2005★ 1 cited
A Software Package to Construct Polynomial Sets over Z_2 for Determining the Output of Quantum Computations
Vladimir P. Gerdt, Vasily M. Severyanov
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…