GET THE APP

Quantum annealing for solving combinatorial optimization problems
..

Journal of Lasers, Optics & Photonics

ISSN: 2469-410X

Open Access

Quantum annealing for solving combinatorial optimization problems


3rd International Conference on Quantum Optics and Quantum Computing

September 10-11, 2018 | London, UK

Thomas Back

Leiden University, The Netherlands

Posters & Accepted Abstracts: J Laser Opt Photonics

Abstract :

Quantum processing units (QPUs) such as those made by D-Wave Systems can be used for solving complex combinatorial optimization problems, which makes them increasingly attractive for researchers in this domain. For the author, coming from the field of evolutionary computation, the potential of applying QPUs in this domain is truly exciting. In this presentation, the author will review a canonical NP-hard problem, the maximum independent set (MIS) problem, in order to measure performance of the D-Wave 2000Q quantum annealer. The results from the D-Wave machine are compared to classical algorithms such as simulated thermal annealing and the graphical networks package NetworkX. In addition, some results obtained by applying an additional optimization algorithm for tuning the QPU parameters are also discussed. These results detail how we can apply problem-specific tuning to the quantum annealer.

arrow_upward arrow_upward