Lov{\'a}sz Local Lemma (LLL) is a very powerful tool in combinatorics and probability theory to show the possibility of avoiding all ``bad" events under some ``weakly dependent" condition. Over the last decades, the algorithmic aspect of LLL has also attracted lots of attention in theoretical computer science \cite{moser2010constructive, kolipaka2011moser, harvey2015algorithmic}. A tight criterion under which the \emph{abstract} version LLL holds was given by Shearer ~\cite{shearer1985problem}. It turns out that Shearer's bound is generally not tight for \emph{variable} version LLL (VLLL)~\cite{he2017variable}. Recently, Ambainis et al. \cite{ambainis2012quantum} introduced a quantum version LLL (QLLL), which was then shown to be powerful for quantum satisfiability problem.

In this paper, we prove that Shearer's bound is tight for QLLL, affirming a conjecture proposed by Sattath et. al.~\cite{pnas}. Our result shows the tightness of Gily{\'e}n and Sattath's algorithm \cite{gilyen2016preparing}, and implies that the lattice gas partition function fully characterizes quantum satisfiability for almost all Hamiltonians with large enough qudits~\cite{pnas}.

Commuting LLL (CLLL), LLL for commuting local Hamiltonians which are widely studied in literature, is also investigated here. We prove that the tight regions of CLLL and QLLL are generally different. Thus, the efficient region of algorithms for CLLL can go beyond shearer's bound. Our proof is by first bridging CLLL and VLLL on a family of interaction bipartite graphs and then applying the tools of VLLL, e.g., the gapless/gapful results, to CLLL. We also provide a sufficient and necessary condition for deciding whether the tight regions of QLLL and CLLL are the same for a given interaction bipartite graph.