28 citations · 36 across the 3 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
quant-ph2018★ 28 cited
Efficient Combinatorial Optimization Using Quantum Annealing
Hristo N. Djidjev, Guillaume Chapuis, Georg Hahn +1
The recent availability of the first commercial quantum computers has provided a promising tool to tackle NP hard problems which can only be solved heuristically with present techn…
quant-ph2018★ 5 cited
Finding Maximum Cliques on the D-Wave Quantum Annealer
Guillaume Chapuis, Hristo N. Djidjev, Georg Hahn +1
This paper assesses the performance of the D-Wave 2X (DW) quantum annealer for finding a maximum clique in a graph, one of the most fundamental and important NP-hard problems. Beca…