An algorithm for constructing polynomial systems whose solution space characterizes quantum circuits

Vladimir P. Gerdt; Vasily M. Severyanov

doi:10.1117/12.683121

31 May 2006 An algorithm for constructing polynomial systems whose solution space characterizes quantum circuits

Vladimir P. Gerdt, Vasily M. Severyanov

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

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available