#### Filter Results:

- Full text PDF available (2)

#### Publication Year

1997

2006

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

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 polynomial systems over the finite field Z2 arising when applying the Feynman’s sum-over-paths approach to quantum circuits. The matrix elements determined by a circuit can be… (More)

- Vasily Severyanov
- PaCT
- 1997

Recently it has been shown that elements of the unitary matrix determined by a quantum circuit can be computed by counting the number of common roots in the ˇnite ˇeld Z2 for a certain set of multivariate polynomials over Z2. In this paper we present a C# package that allows a user to assemble a quantum circuit and to generate the multivariate polynomial… (More)

- ‹
- 1
- ›