8 citations · 8 across the 1 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2002
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…
quant-ph2002
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…