Efficient algorithm for a quantum analogue of 2-SAT

Abstract

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.

13 pages

Cited by in corpus (8)

• Hamiltonian complexity
• Quantum Hamiltonian Complexity
• A new construction for a QMA complete 3-local Hamiltonian
• An introduction to quantum annealing
• A Quantum Lovasz Local Lemma
• Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete
• Ground-state Stabilization of Open Quantum Systems by Dissipation
• The SAT-UNSAT transition in the adversarial SAT problem