1203.6161 (Anderson de Araújo et al.)

Classical and quantum satisfiability    [PDF]

Anderson de Araújo, Marcelo Finger

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.

View original: http://arxiv.org/abs/1203.6161