Computational Optimization and Applications

, Volume 65, Issue 3, pp 845–869

Building an iterative heuristic solver for a quantum annealer

  • Gili Rosenberg
  • Mohammad Vazifeh
  • Brad Woods
  • Eldad Haber
Article

DOI: 10.1007/s10589-016-9844-y

Cite this article as:
Rosenberg, G., Vazifeh, M., Woods, B. et al. Comput Optim Appl (2016) 65: 845. doi:10.1007/s10589-016-9844-y
  • 98 Downloads

Abstract

A quantum annealer heuristically minimizes quadratic unconstrained binary optimization (QUBO) problems, but is limited by the physical hardware in the size and density of the problems it can handle. We have developed a meta-heuristic solver that utilizes D-Wave Systems’ quantum annealer (or any other QUBO problem optimizer) to solve larger or denser problems, by iteratively solving subproblems, while keeping the rest of the variables fixed. We present our algorithm, several variants, and the results for the optimization of standard QUBO problem instances from OR-Library of sizes 500 and 2500 as well as the Palubeckis instances of sizes 3000–7000. For practical use of the solver, we show the dependence of the time to best solution on the desired gap to the best known solution. In addition, we study the dependence of the gap and the time to best solution on the size of the problems solved by the underlying optimizer. Our results were obtained by simulation, using a tabu 1-opt solver, due to the huge number of runs required and limited quantum annealer time availability.

Keywords

Quantum annealing Quadratic unconstrained binary optimization Combinatoric optimization k-opt Local search Iterative heuristic solver 

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Gili Rosenberg
    • 1
  • Mohammad Vazifeh
    • 1
  • Brad Woods
    • 1
  • Eldad Haber
    • 2
  1. 1.1QB Information Technologies (1QBit)VancouverCanada
  2. 2.Department of Mathematics and Earth and Ocean ScienceUniversity of British ColumbiaVancouverCanada

Personalised recommendations