2000 character limit reached
Classical and quantum satisfiability (1203.6161v1)
Published 28 Mar 2012 in cs.CC and quant-ph
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.