Classical and quantum satisfiability

Details Classical and quantum satisfiability Classical and quantum satisfiability

2012-03-28

arxiv.org/abs/1203.6161v1

EPTCS 81, 2012, pp. 79-84

Computer Science

Computational Complexity

In Proceedings LSFA 2011, arXiv:1203.5423

Scientific paper

10.4204/EPTCS.81.6

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.

Affiliated with

Also associated with

No associations

Rating

Classical and quantum satisfiability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Classical and quantum satisfiability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classical and quantum satisfiability will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-271841