Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP

Valiant introduced matchgate computation and holographic algorithms. A number of seemingly exponential time problems can be solved by this novel algorithmic paradigm in polynomial time. We show that, in a very strong sense, matchgate computations and holographic algorithms based on them provide a universal methodology to a broad class of counting problems studied in the statistical physics community for decades. They capture precisely those problems which are #P-hard on general graphs but computable in polynomial time on planar graphs. More precisely, we prove complexity dichotomy theorems in the framework of counting CSP problems. The local constraint functions take Boolean inputs and can be arbitrary real-valued symmetric functions. We prove that every problem in this class belongs to precisely three categories: (1) those which are tractable (i.e., polynomial time computable) on general graphs, or (2) those which are #P-hard on general graphs but tractable on planar graphs, or (3) those which are #P-har...

[1]  Jin-Yi Cai,et al.  Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_#CSP , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[2]  Jin-Yi Cai,et al.  Graph Homomorphisms with Complex Values: A Dichotomy Theorem , 2013, SIAM J. Comput..

[3]  Jin-Yi Cai,et al.  Holographic algorithms: from art to science , 2007, STOC '07.

[4]  Jin-Yi Cai,et al.  Holographic algorithms with unsymmetric signatures , 2008, SODA '08.

[5]  M. Fisher,et al.  Dimer problem in statistical mechanics-an exact result , 1961 .

[6]  Chen Ning Yang,et al.  The Spontaneous Magnetization of a Two-Dimensional Ising Model , 1952 .

[7]  Jin-Yi Cai,et al.  Holant Problems for Regular Graphs with Complex Edge Functions , 2010, STACS.

[8]  P. Dienes,et al.  On tensor geometry , 1926 .

[9]  Leslie G. Valiant,et al.  The Complexity of Symmetric Boolean Parity Holant Problems , 2013, SIAM J. Comput..

[10]  Jin-Yi Cai,et al.  Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[11]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[12]  J. Booker,et al.  Discussion-•-— »-— — — — — , 1998 .

[13]  Jin-Yi Cai,et al.  Bases Collapse in Holographic Algorithms , 2007, Computational Complexity Conference.

[14]  Jin-Yi Cai,et al.  Some Results on Matchgates and Holographic Algorithms , 2007, Int. J. Softw. Informatics.

[15]  Martin E. Dyer,et al.  The complexity of counting graph homomorphisms , 2000, Random Struct. Algorithms.

[16]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[17]  P. W. Kasteleyn.  The Statistics of Dimers on a Lattice , 1961 .

[18]  Martin E. Dyer,et al.  On Counting Homomorphisms to Directed Acyclic Graphs , 2006, ICALP.

[19]  Elliott H. Lieb,et al.  A general Lee-Yang theorem for one-component and multicomponent ferromagnets , 1981 .

[20]  Sorin Istrail,et al.  Statistical mechanics, three-dimensionality and NP-completeness: I. Universality of intracatability for the partition function of the Ising model across non-planar surfaces (extended abstract) , 2000, STOC '00.

[21]  Jin-Yi Cai,et al.  On the Theory of Matchgate Computations , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[22]  Jin-Yi Cai,et al.  A complete dichotomy rises from the capture of vanishing signatures: extended abstract , 2013, STOC '13.

[23]  Jin-Yi Cai,et al.  Holant problems and counting CSP , 2009, STOC '09.

[24]  Leslie G. Valiant,et al.  Holographic Algorithms (Extended Abstract) , 2004, FOCS.

[25]  Salil P. Vadhan,et al.  The Complexity of Counting in Sparse, Regular, and Planar Graphs , 2002, SIAM J. Comput..

[26]  T. D. Lee,et al.  Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model , 1952 .

[27]  Jin-Yi Cai,et al.  On Symmetric Signatures in Holographic Algorithms , 2007, STACS.

[28]  E. Ising.  Beitrag zur Theorie des Ferromagnetismus , 1925 .

[29]  E. M. Opdam,et al.  The two-dimensional Ising model , 2018, From Quarks to Pions.

[30]  Jin-Yi Cai,et al.  A Computational Proof of Complexity of Some Restricted Counting Problems , 2009, TAMC.

[31]  Jin-Yi Cai,et al.  Matchgates Revisited , 2013, Theory Comput..

[32]  Leslie G. Valiant.  Expressiveness of matchgates , 2002, Theor. Comput. Sci..

[33]  Jin-Yi Cai,et al.  From Holant to #CSP and Back: Dichotomy for Holantc Problems , 2012, Algorithmica.

[34]  B. Cipra.  The Ising Model Is NP-Complete , 2000 .

[35]  Peng Zhang,et al.  Computational complexity of counting problems on 3-regular planar graphs , 2007, Theor. Comput. Sci..

[36]  L. Lovasz,et al.  Reflection positivity, rank connectivity, and homomorphism of graphs , 2004, math/0404468.

[37]  M. .. Moore.  Exactly Solved Models in Statistical Mechanics , 1983 .

[38]  Andrei A. Bulatov,et al.  The complexity of partition functions , 2005, Theor. Comput. Sci..

[39]  Andrei A. Bulatov,et al.  The complexity of the counting constraint satisfaction problem , 2008, JACM.

[40]  Leslie G. Valiant,et al.  Quantum Circuits That Can Be Simulated Classically in Polynomial Time , 2002, SIAM J. Comput..

[41]  Jin-Yi Cai,et al.  Valiant's Holant Theorem and Matchgate Tensors , 2006, TAMC.

[42]  Michael Kowalczyk.  Classification of a Class of Counting Problems Using Holographic Reductions , 2009, COCOON.