Abstract
We establish a 1-1 correspondence between Valiant’s character theory of matchgate/matchcircuit [14] and his signature theory of planar-matchgate/matchgrid [16], thus unifying the two theories in expressibility. In [3], we had established a complete characterization of general matchgates, in terms of a set of useful Grassmann-Plücker identities. With this correspondence, we give a corresponding set of identities which completely characterizes planar-matchgates and their signatures. Applying this characterization we prove some negative results for holographic algorithms. On the positive side, we also give a polynomial time algorithm for a simultaneous node-edge deletion problem, using holographic algorithms. Finally we give characterizations of symmetric signatures realizable in the Hadamard basis.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aitken, A.C.: Determinants and Matrices, Oliver and Boyd, London (1951)
Cai, J.-Y., Choudhary, V.: Valiant’s Holant Theorem and Matchgate Tensors. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol. 3959, Springer, Heidelberg (2006)
Cai, J.-Y., Choudhary, V.: On the Theory of Matchgate Computations. Submitted. Also available at ECCC TR06-018
Cai, J.-Y., Choudhary, V.: Some Results on Matchgates and Holographic Algorithms. ECCC TR06-048
Hadlock, F.: Finding a Maximum Cut of a Planar Graph in Polynomial Time. SIAM Journal on Computing 4, 221–225 (1975)
Jansen, K., Karpinski, M., Lingas, A., Seidel, E.: Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 365–375. Springer, Heidelberg (2001)
Jerrum, M.R.: Two-dimensional Monomer-Dimer Systems are Computationally Intractable. Journal of Statistical Physics 48 (1/2), 121-134 (1987); also 59 (3/4), 1087-1088 (1990)
Kasteleyn, P.W.: The statistics of dimers on a lattice. Physica 27, 1209–1225 (1961)
Kasteleyn, P.W.: Graph Theory and Crystal Physics. In: Harary, F. (ed.) Graph Theory and Theoretical Physics, pp. 43–110. Academic Press, London (1967)
MacWilliams, F., Sloane, N.: The Theory of Error-Correcting Codes, p. 309. NorthHolland, Amsterdam (1977)
Murota, K.: Matrices and Matroids for Systems Analysis. Springer, Berlin (2000)
Temperley, H.N.V., Fisher, M.E.: Dimer problem in statistical mechanics – an exact result. Philosophical Magazine 6, 1061–1063 (1961)
Vadhan, S.P.: The Complexity of Counting in Sparse, Regular and Planar Graphs. SIAM Journal on Computing 8(1), 398–427 (2001)
Valiant, L.G.: Quantum circuits that can be simulated classically in polynomial time. SIAM Journal on Computing 31(4), 1229–1254 (2002)
Valiant, L.G.: Expressiveness of Matchgates. Theoretical Computer Science 281(1), 457-471 (2002); See also 299, 795 (2003)
Valiant, L.G.: Holographic Algorithms (Extended Abstract). In: Proc. 45th IEEE Symposium on Foundations of Computer Science, pp. 306–315. A more detailed version appeared in Electronic Colloquium on Computational Complexity Report TR05-099 (2004)
Valiant, L.G.: Holographic circuits. In: Proc. 32nd International Colloquium on Automata, Languages and Programming, pp. 1–15 (2005)
Valiant, L.G.: Completeness for parity problems. In: Proc. 11th International Computing and Combinatorics Conference (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cai, JY., Choudhary, V. (2006). Some Results on Matchgates and Holographic Algorithms. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11786986_61
Download citation
DOI: https://doi.org/10.1007/11786986_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35904-3
Online ISBN: 978-3-540-35905-0
eBook Packages: Computer ScienceComputer Science (R0)