Tensors masquerading as matchgates: Relaxing planarity restrictions on Pfaffian circuits

Abstract

TURNERÅbstract. Holographic algorithms, alternatively known as Pfaffian circuits, have received a great deal of attention for giving polynomial-time algorithms of #P-hard problems. Much work has been done to determine the extent of what this machinery can do and the expressiveness of these circuits. One aspect of interest is the fact that these circuits must be planar. Work has been done to try and relax the planarity conditions and extend these algorithms further. We show that an approach based on orbit closures does not work, but give a different technique for allowing the SWAP gate to be used in a Pfaffian circuit given a suitable basis and restricted type of graph. This is done by exploiting the fact that the set of Pfaffian (co)gates always lies in a hyperplane. We then give a variety of bases that can be chosen such that the SWAP gate acts like a Pfaffian cogate and discuss how many SWAP gates can be implemented in a Pfaffian circuit.

A Finite-Tame-Wild Trichotomy Theorem for Tensor Diagrams

“…This includes the question of both classifying and recognizing Holant problems, holographic circuits, and matchgates (cf. [29,37]). Recognizing a holographic circuit in an arbitrary basis is still an open problem as they are formulated with respect to a specific basis.…”