Efficient algorithm for a quantum analogue of 2-SAT
| dc.creator | Bravyi, Sergey | |
| dc.date | 2006-02-14 | |
| dc.date.accessioned | 2026-07-07T07:04:18Z | |
| dc.date.available | 2026-07-07T07:04:18Z | |
| dc.description | 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. | |
| dc.description | 13 pages | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0602108 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0602108 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/109311 | |
| dc.subject | Quantum Physics | |
| dc.title | Efficient algorithm for a quantum analogue of 2-SAT | |
| dc.type | text |