136 citations · 513 across the 37 of their papers we have counts for
3 papers · 2 filters
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…
Reducing Binary Quadratic Forms for More Scalable Quantum Annealing
Georg Hahn, Hristo N. Djidjev
Recent advances in the development of commercial quantum annealers such as the D-Wave 2X allow solving NP-hard optimization problems that can be expressed as quadratic unconstraine…
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…