Home > Research > Publications & Outputs > Finding Maximum Cliques on the D-Wave Quantum A...

Links

Text available via DOI:

View graph of relations

Finding Maximum Cliques on the D-Wave Quantum Annealer

Research output: Contribution to journalJournal article

Published
  • Guillaume Chapuis
  • Hristo Djidjev
  • Georg Hahn
  • Guillaume Rizk
Close
<mark>Journal publication date</mark>1/03/2019
<mark>Journal</mark>Journal of Signal Processing Systems
Issue number3-4
Volume91
Number of pages15
Pages (from-to)363–377
Publication statusPublished
Early online date3/05/18
Original languageEnglish

Abstract

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. Because the size of the largest graphs DW can directly solve is quite small (usually around 45 vertices), we also consider decomposition algorithms intended for larger graphs and analyze their performance. For smaller graphs that fit DW, we provide formulations of the maximum clique problem as a quadratic unconstrained binary optimization (QUBO) problem, which is one of the two input types (together with the Ising model) acceptable by the machine, and compare several quantum implementations to current classical algorithms such as simulated annealing, Gurobi, and third-party clique finding heuristics. We further estimate the contributions of the quantum phase of the quantum annealer and the classical post-processing phase typically used to enhance each solution returned by DW. We demonstrate that on random graphs that fit DW, no quantum speedup can be observed compared with the classical algorithms. On the other hand, for instances specifically designed to fit well the DW qubit interconnection network, we observe substantial speed-ups in computing time over classical approaches.

Bibliographic note

The final publication is available at Springer via http://dx.doi.org/10.1007/s11265-018-1357-8