A C# Package for Assembling Quantum Circuits and Generating Associated Polynomial Sets
نویسندگان
چکیده
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 set associated with the circuit. The generated polynomial system can further be converted to the canonical triangular involutive basis form which is appropriate for counting the number of common roots of the polynomials.
منابع مشابه
An Algorithm for Constructing Polynomial Systems Whose Solution Space Characterizes Quantum Circuits
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 computed by counting the number of common...
متن کاملTutte polynomials of wheels via generating functions
We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.
متن کاملOn computer algebra application to simulation of quantum computation
In the present paper which is an extended version of paper [1] we consider a Mathematica-based package for simulation of quantum circuits. It provides a user-friendly graphical interface to specify a quantum circuit, to draw it, and to construct the unitary matrix for quantum computation defined by the circuit. The matrix is computed by means of the linear algebra tools built-in Mathematica. Fo...
متن کاملOptimizing Teleportation Cost in Multi-Partition Distributed Quantum Circuits
There are many obstacles in quantum circuits implementation with large scales, so distributed quantum systems are appropriate solution for these quantum circuits. Therefore, reducing the number of quantum teleportation leads to improve the cost of implementing a quantum circuit. The minimum number of teleportations can be considered as a measure of the efficiency of distributed quantum systems....
متن کاملNew methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...
متن کامل