Translator Disclaimer
31 May 2006 An algorithm for constructing polynomial systems whose solution space characterizes quantum circuits
Author Affiliations +
Proceedings Volume 6264, Quantum Informatics 2005; 626406 (2006) https://doi.org/10.1117/12.683121
Event: Quantum Informatics 2005, 2005, Moscow, Russian Federation
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.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Vladimir P. Gerdt and Vasily M. Severyanov "An algorithm for constructing polynomial systems whose solution space characterizes quantum circuits", Proc. SPIE 6264, Quantum Informatics 2005, 626406 (31 May 2006); https://doi.org/10.1117/12.683121
PROCEEDINGS
10 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT


Back to Top