Aldi, Marco, et al. “On Efficiently Solvable Cases of Quantum K-SAT.”10.4230/LIPIcs.MFCS.2018.38__43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), edited by Igor Potapov et al., vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 38:1-38:16, doi:10.4230/LIPIcs.MFCS.2018.38.

de Beaudrap, Niel, and Sevag Gharibian. “A Linear Time Algorithm for Quantum 2-SAT.”10.4230/LIPIcs.CCC.2016.27__Proceedings of the 31st Conference on Computational Complexity (CCC 2016), edited by Ran Raz, vol. 50, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, p. 27:1-17:21, doi:10.4230/LIPIcs.CCC.2016.27.