A Graphical #SAT Algorithm for Formulae with Small Clause Density

Watch a 27-minute conference talk from the 18th Theory of Quantum Computation, Communication and Cryptography Conference (TQC 2023) exploring a novel approach to the counting version of Boolean satisfiability (#SAT) using ZH-calculus. Learn how this graphical language, originally developed for quantum circuit analysis, can be applied to study formulae with small clause density. Presented by Tuomas Laakkonen at the University of Aveiro, Portugal, this research presentation delves into theoretical aspects of quantum information science, demonstrating the intersection of quantum computing concepts with classical computational problems. The talk is based on research published in arXiv and represents cutting-edge work in theoretical quantum information science, presented at a premier international conference that brings together leading researchers and students in the field.