Share Email Print

Proceedings Paper

An algorithm for constructing polynomial systems whose solution space characterizes quantum circuits
Author(s): Vladimir P. Gerdt; Vasily M. Severyanov
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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 roots in Z2 for the polynomial system associated with the circuit. To determine the number of solutions in Z2 for the output polynomial system, one can use the Grobner bases method and the relevant algorithms for computing Grobner bases.

Paper Details

Date Published: 31 May 2006
PDF: 10 pages
Proc. SPIE 6264, Quantum Informatics 2005, 626406 (31 May 2006); doi: 10.1117/12.683121
Show Author Affiliations
Vladimir P. Gerdt, Joint Institute for Nuclear Research (Russia)
Vasily M. Severyanov, Joint Institute for Nuclear Research (Russia)

Published in SPIE Proceedings Vol. 6264:
Quantum Informatics 2005
Yuri I. Ozhigov, Editor(s)

© SPIE. Terms of Use
Back to Top