Matchgate signatures under variable permutations

DOI10.4230/LIPICS.ISAAC.2025.50MaRDI QIDQ7364400zbMATH OpenFDO

Authors Boning Meng, Yicheng Pan

Publication date 1 October 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2025.50

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Complexity classifications of Boolean constraint satisfaction problems
• Complexity Dichotomies for Counting Problems
• Dimer problem in statistical mechanics-an exact result
• Expressiveness of matchgates.
• From holant to quantum entanglement and back
• Holant problems and counting CSP
• Holographic algorithm with matchgates is universal for planar \#CSP over Boolean domain
• Holographic Algorithms
• scientific article; zbMATH DE number 3326387 (Why is no real title available?)
• Killing a vortex
• On the theory of matchgate computations
• Parameterizing the permanent: hardness for fixed excluded minors
• Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits
• Quantum computers that can be simulated classically in polynomial time
• The complexity of complex weighted Boolean \#CSP
• The complexity of computing the permanent
• The complexity of planar Boolean \#CSP with complex weights
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
• Valiant's holant theorem and matchgate tensors

This page was built for publication: Matchgate signatures under variable permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364400)