Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) (2007)
San Diego, California
June 13, 2007 to Mar. 16, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCC.2007.22
Jin-Yi Cai , Computer Sciences Dept., University of Wisconsin, USA
Vinay Choudhary , Computer Sciences Dept., University of Wisconsin, USA
Pinyan Lu , Dept. of Computer Sc. & Tech., Tsinghua University, China
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this new theory. We give a set of algebraic identities which completely characterizes these objects for arbitrary numbers of inputs and outputs. These identities are derived from Grassmann-Plücker identities. The 4 by 4 matchgate character matrices are of particular interest. These were used in Valiant's classical simulation of a fragment of quantum computations. For these 4 by 4 matchgates, we use Jacobi's theorem on compound matrices to prove that the invertible matchgate matrices form a multiplicative group. Our results can also be expressed in the theory of Holographic Algorithms in terms of realizable standard signatures. These results are useful in establishing limitations on the ultimate capabilities of Valiant's theory of matchgate computations and Holographic Algorithms.
computational complexity, Jacobian matrices
J. Cai, V. Choudhary and P. Lu, "On the Theory of Matchgate Computations," Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)(CCC), San Diego, California, 2008, pp. 305-318.