Efficient algorithm for a quantum analogue of 2-SAT

Details Efficient algorithm for a quantum analogue of 2-SAT Efficient algorithm for a quantum analogue of 2-SAT

2006-02-14

arxiv.org/abs/quant-ph/0602108v1

Physics

Quantum Physics

13 pages

Scientific paper

Complexity of a quantum analogue of the satisfiability problem is studied. Quantum k-SAT is a problem of verifying whether there exists n-qubit pure state such that its k-qubit reduced density matrices have support on prescribed subspaces. We present a classical algorithm solving quantum 2-SAT in a polynomial time. It generalizes the well-known algorithm for the classical 2-SAT. Besides, we show that for any k>=4 quantum k-SAT is complete in the complexity class QMA with one-sided error.

Affiliated with

Also associated with

No associations

Rating

Efficient algorithm for a quantum analogue of 2-SAT 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 Efficient algorithm for a quantum analogue of 2-SAT, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient algorithm for a quantum analogue of 2-SAT will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-255388