Classical-Quantum Mixing in the Random 2-Satisfiability Problem
Abstract
Classical satisfiability (SAT) and quantum satisfiability (QSAT) are complete problems for the complexity classes NP and QMA which are believed to be intractable for classical and quantum computers, respectively. Statistical ensembles of instances of these problems have been studied previously in an attempt to elucidate their typical, as opposed to worst case, behavior. In this paper we introduce a new statistical ensemble that interpolates between classical and quantum. For the simplest 2-SAT/2-QSAT ensemble we find the exact boundary that separates SAT and UNSAT instances. We do so by establishing coincident lower and upper bounds, in the limit of large instances, on the extent of the UNSAT and SAT regions, respectively.
Cite
@article{arxiv.1502.04700,
title = {Classical-Quantum Mixing in the Random 2-Satisfiability Problem},
author = {Ionut-Dragos Potirniche and C. R. Laumann and S. L. Sondhi},
journal= {arXiv preprint arXiv:1502.04700},
year = {2015}
}
Comments
Updated references