Basis collapse for holographic algorithms over all domain sizes

DOI10.1145/2897518.2897546zbMath1375.68183arXiv1511.00778OpenAlexW2225490616MaRDI QIDQ5361879

Sitan Chen

Publication date: 29 September 2017

Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.00778

zbMATH Keywords

perfect matchingsholographic algorithmsmatchgatesbasis collapse

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05)

Related Items (4)

Some observations on holographic algorithms ⋮ On blockwise symmetric matchgate signatures and higher domain \#CSP ⋮ Holographic algorithms on domains of general size ⋮ Clifford gates in the Holant framework

This page was built for publication: Basis collapse for holographic algorithms over all domain sizes