Classical and quantum satisfiability
arXiv:1203.6161 · doi:10.4204/EPTCS.81.6
Abstract
We present the linear algebraic definition of QSAT and propose a direct logical characterization of such a definition. We then prove that this logical version of QSAT is not an extension of classical satisfiability problem (SAT). This shows that QSAT does not allow a direct comparison between the complexity classes NP and QMA, for which SAT and QSAT are respectively complete.
In Proceedings LSFA 2011, arXiv:1203.5423