# Holographic algorithms without matchgates

@article{Landsberg2009HolographicAW,
title={Holographic algorithms without matchgates},
author={Joseph Landsberg and Jason Morton and Serguei Norine},
journal={ArXiv},
year={2009},
volume={abs/0904.0471}
}
• Published 2 April 2009
• Mathematics, Computer Science
• ArXiv

## Figures from this paper

Basis collapse for holographic algorithms over all domain sizes
This work has resolved the conjecture that over domain size k there is a collapse to basis size ⌊log2 k⌋, and resolved this conjecture in the affirmative for signatures of full rank for all k.
Pfaffian Circuits
A new, simplified construction of holographic algorithms in terms of Pfaffian circuits is described, including efficient algorithms for certain lattice path problems and an O(np ) algorithm for evaluation of Tutte polynomials of lattICE path matroids.
Advances in the Computational Complexity of Holant Problems
The motivation for this work is to understand the limits of efficient computation, since polynomial interpolation is intimately connected with integer solutions of algebraic curves and determinations of Galois groups, subjects that remain active areas of research in pure mathematics.
Matchgates Revisited
• Computer Science, Mathematics
Theory Comput.
• 2013
A direct proof that Matchgate Identities (MGI) are necessary and sufficient conditions for matchgate signatures and a simplified construction of a crossover gadget are used in the proof of sufficiency of MGI for matchGate signatures.
Holographic algorithm with matchgates is universal for planar #CSP over boolean domain
• Computer Science
STOC
• 2017
We prove a complexity classification theorem that classifies all counting constraint satisfaction problems (#CSP) over Boolean variables into exactly three classes: (1) Polynomial-time solvable; (2)
FKT is Not Universal — A Planar Holant Dichotomy for Symmetric Constraints
• Computer Science
Theory Comput. Syst.
• 2022
A complexity classification for Holant problems defined by an arbitrary set of complex-valued symmetric constraint functions on Boolean variables and a dichotomy for planar #CSP 2 is proved, which proves the putative form of the dichotomy is true.
A Holant Dichotomy: Is the FKT Algorithm Universal?
• Computer Science
2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
A complexity dichotomy is proved for complex-weighted Holant problems with an arbitrary set of symmetric constraint functions on Boolean variables to prove that the presumed universality holds for #CSP2.

## References

SHOWING 1-10 OF 34 REFERENCES
Holographic algorithms
• L. Valiant
• Mathematics, Computer Science
45th Annual IEEE Symposium on Foundations of Computer Science
• 2004
A new notion of efficient reduction among computational problems is introduced and families of polynomial systems such that the solvability of any one member would imply P/sup #P/ = NC2.
Holographic Algorithms (Extended Abstract)
A new notion of efficient reduction among computational problems is introduced and families of polynomial systems such that the solvability of any one member would imply P^(#P) = NC2.
Bases Collapse in Holographic Algorithms
• Computer Science
Computational Complexity Conference
• 2007
A general collapse theorem for bases of dimension 4 to dimension 2 in the holographic algorithms framework is given and a Basis Folding Theorem is given showing that in a natural setting the support vectors can be simulated by bases of Dimension 2.
Basis Collapse in Holographic Algorithms
• Computer Science
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)
• 2007
A general collapse theorem for bases of dimension 4 to dimension 2 in the holographic algorithms framework is given and a Basis Folding Theorem is given showing that in a natural setting the support vectors can be simulated by bases of Dimension 2.
Some Results on Matchgates and Holographic Algorithms
• Mathematics, Computer Science
Int. J. Softw. Informatics
• 2006
A 1-1 correspondence between Valiant's character theory of matchgate/matchcircuit and his signature theory of planar-matchgate/ matchgrid is established, thus unifying the two theories in expressibility and giving characterizations of symmetric signatures realizable in the Hadamard basis.
On Symmetric Signatures in Holographic Algorithms
• Computer Science, Mathematics
Theory of Computing Systems
• 2009
It is shown that the same unexpected holographic algorithm can be realized over a basis of size 1, and it is proved that 7 is the only modulus for which such an “accidental algorithm” exists.
Accidental Algorithms
It is shown that for the NP-complete general 3CNF problem no such elementary matchgrid algorithm can exist, however, that it remains open for many natural #Pcomplete problems whether such Elementary matchgrid algorithms exist, and for the general CNF problem whether non-elementary match grid algorithms exist.
Pfaffian Circuits
A new, simplified construction of holographic algorithms in terms of Pfaffian circuits is described, including efficient algorithms for certain lattice path problems and an O(np ) algorithm for evaluation of Tutte polynomials of lattICE path matroids.
Holographic algorithms: from art to science
• Mathematics, Computer Science
STOC '07
• 2007
Going beyond symmetric signatures, d-admissibility and d-realizability for general signatures are defined, and the general machinery is able to give unexpected holographic algorithms for some counting problems, modulo certain Mersenne type integers.
Quantum computers that can be simulated classically in polynomial time
It is shown that two-bit operations characterized by 4 \times 4 matrices in which the sixteen entries obey a set of five polynomial relations can be composed according to certain rules to yield a class of circuits that can be simulated classically in polynometric time.