15 citations · 69 across the 11 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
quant-ph2022★ 8 cited
On the hardness of quadratic unconstrained binary optimization problems
Vrinda Mehta, Fengping Jin, Kristel Michielsen +1
We use exact enumeration to characterize the solutions of quadratic unconstrained binary optimization problems of less than 21 variables in terms of their distributions of Hamming…
quant-ph2022★ 12 cited
Quantum annealing for hard 2-SAT problems : Distribution and scaling of minimum energy gap and success probability
Vrinda Mehta, Fengping Jin, Hans De Raedt +1
In recent years, quantum annealing has gained the status of being a promising candidate for solving various optimization problems. Using a set of hard 2-satisfiabilty (2-SAT) probl…