8 citations · 15 across the 3 of their papers we have counts for
5 papers
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…
Model reconstruction of nonlinear dynamical systems driven by noise
V. N. Smelyanskiy, D. A. Timucin, A. Bandrivskyy +1
An efficient technique is introduced for model inference of complex nonlinear dynamical systems driven by noise. The technique does not require extensive global optimization, provi…
Total suppression of a large spin tunneling barrier in quantum adiabatic computation
Alex Bulatov, Vadim Smelyanskiy
We apply a quantum adiabatic evolution algorithm to a combinatorial optimization problem where the cost function depends entirely on the of the number of unit bits in a n-bit strin…
Dynamics of quantum adiabatic evolution algorithm for Number Partitioning
Vadim N. Smelyanskiy, Udo v. Toussaint, Dogan A. Timucin
We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic lim…
Simulations of the adiabatic quantum optimization for the Set Partition Problem
V. N. Smelyanskiy, U. V. Toussaint, D. A. Timucin
We analyze the complexity of the quantum optimization algorithm based on adiabatic evolution for the set partition problem. We introduce a cost function defined on a logarithmic sc…