Classical-Quantum Mixing in the Random 2-Satisfiability Problem.

Ionut-Dragos Potirniche Christopher R. Laumann S. L. Sondhi

Published in: CoRR (2015)

Keyphrases

satisfiability problem
quantum computation
np complete
search algorithm
temporal logic
phase transition
sat problem
quantum mechanics
randomly generated
pspace complete
random sat
stochastic local search algorithms
stochastic local search
sat instances
decision procedures
max sat