On Efficiently Solvable Cases of Quantum k-SAT

Estimating ground state energies of local Hamiltonian models is a central problem in quantum physics. The question of whether a given local Hamiltonian is frustration-free , meaning the ground state is the simultaneous ground state of all local interaction terms, is known as the Quantum k -SAT ( k -QSAT) problem. In analogy to its classical Boolean constraint satisfaction counterpart, the NP-complete problem k -SAT, Quantum k -SAT is QMA 1 -complete (for k ≥ 3 , and where QMA 1 is a quantum generalization of NP with one-sided error), and thus likely intractable. But whereas k -SAT has been well-studied for special tractable cases, as well as from a “parameterized complexity” perspective, much less is known in similar settings for k -QSAT. Here, we study the open problem of computing satisfying assignments to k -QSAT instances which have a “dimer covering” or “matching”; such systems are known to be frustration-free, but it remains open whether one can efficiently compute a ground state. Our results fall into three directions, all of which relate to the “dimer covering” setting: (1) We give a polynomial-time classical algorithm for k -QSAT when all qubits occur in at most two interaction terms or clauses. (2) We give a “parameterized algorithm” for k -QSAT instances from a certain non-trivial class, which allows us to obtain exponential speedups over brute force methods in some cases. This is achieved by reducing the problem to solving for a single root of a single univariate polynomial. An explicit family of hypergraphs, denoted Crash, for which such a speedup is obtained is introduced. (3) We conduct a structural graph theoretic study of 3-QSAT interaction graphs which have a “dimer covering”. We remark that the results of (2), in particular, introduce a number of new tools to the study of Quantum SAT, including graph theoretic concepts such as transfer filtrations and blow-ups from algebraic geometry.