5 citations · 5 across the 3 of their papers we have counts for
Showing 2004Show all
2 papers · 1 filter
cond-mat.dis-nn2004★ 5 cited
Approximating satisfiability transition by suppressing fluctuations
S. Knysh, V. N. Smelyanskiy, R. D. Morris
Using methods and ideas from statistical mechanics, we propose a simple method for obtaining rigorous upper bounds for satisfiability transition in random boolean expressions compo…
quant-ph2004
Quantum adiabatic optimization and combinatorial landscapes
V. N. Smelyanskiy, S. Knysh, R. D. Morris
In this paper we analyze the performance of the Quantum Adiabatic Evolution algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ra…