Classical and quantum satisfiability
Computational Complexity
2012-03-29 v1 Quantum Physics
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.
Keywords
Cite
@article{arxiv.1203.6161,
title = {Classical and quantum satisfiability},
author = {Anderson de Araújo and Marcelo Finger},
journal= {arXiv preprint arXiv:1203.6161},
year = {2012}
}
Comments
In Proceedings LSFA 2011, arXiv:1203.5423