Efficient algorithm for a quantum analogue of 2-SAT
量子物理
2007-05-23 v1
摘要
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.
引用
@article{arxiv.quant-ph/0602108,
title = {Efficient algorithm for a quantum analogue of 2-SAT},
author = {Sergey Bravyi},
journal= {arXiv preprint arXiv:quant-ph/0602108},
year = {2007}
}
备注
13 pages