论文信息 - Classical and quantum satisfiability

Classical and quantum satisfiability

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.

Marcelo Finger | Anderson de Araújo | Anderson Beraldo De Araújo | M. Finger

[1] I. Chuang,et al. Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition , 2010 .

[2] Gilles Brassard,et al. Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[3] Christopher R. Laumann,et al. Random quantum satisfiability , 2010, Quantum Inf. Comput..

[4] Alexander Russell,et al. Bounds on the Quantum Satisfiability Threshold , 2009, ICS.

[5] Yi-Kai Liu. Consistency of Local Density Matrices Is QMA-Complete , 2006, APPROX-RANDOM.

[6] Roderich Moessner,et al. Random quantum satisfiabiilty , 2010 .

[7] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .

[8] W. Spears. Probabilistic Satisfiability , 1992 .

[9] Christos H. Papadimitriou,et al. Probabilistic satisfiability , 1988, J. Complex..

[10] Sergey Bravyi,et al. Efficient algorithm for a quantum analogue of 2-SAT , 2006, quant-ph/0602108.

[11] Mikhail N. Vyalyi,et al. Classical and Quantum Computation , 2002, Graduate studies in mathematics.