A note on QUBO instances defined on Chimera graphs

McGeoch and Wang (2013) recently obtained optimal or near-optimal solutions to some quadratic unconstrained boolean optimization (QUBO) problem instances using a 439 qubit D-Wave Two quantum computing system in much less time than with the IBM ILOG CPLEX mixed-integer quadratic programming (MIQP) solver. The problems studied by McGeoch and Wang are defined on subgraphs ‐ with up to 439 nodes ‐ of Chimera graphs. We observe that after a standard reformulation of the QUBO problem as a mixed-integer linear program (MILP), the specific instances used by McGeoch and Wang can be solved to optimality with the CPLEX MILP solver in much less time than the time reported in McGeoch and Wang for the CPLEX MIQP solver. However, the solution time is still more than the time taken by the D-Wave computer in the McGeoch-Wang tests.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  C. Zheng,et al.  ; 0 ; , 1951 .

[3]  Garth P. McCormick,et al.  Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..

[4]  F. Barahona,et al.  On the exact ground states of three-dimensional Ising spin glasses , 1982 .

[5]  F. Barahona.  On the computational complexity of Ising spin glass models , 1982 .

[6]  Ali Ridha Mahjoub,et al.  On the cut polytope , 1986, Math. Program..

[7]  Michael Jünger,et al.  Experiments in quadratic 0–1 programming , 1989, Math. Program..

[8]  Caterina De Simone,et al.  The cut polytope and the Boolean quadric polytope , 1990, Discret. Math..

[9]  G. Rinaldi,et al.  Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm , 1995 .

[10]  Matteo Fischetti,et al.  {0, 1/2}-Chvátal-Gomory cuts , 1996, Math. Program..

[11]  G. Rinaldi,et al.  Exact ground states of two-dimensional ±J Ising spin glasses , 1996 .

[12]  Michael J. Todd,et al.  Mathematical programming , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[13]  Francisco Barahona,et al.  Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut , 2006, RAIRO Oper. Res..

[14]  Endre Boros,et al.  Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO) , 2007, J. Heuristics.

[15]  Alain Billionnet,et al.  Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem , 2007, Math. Program..

[16]  M. W. Johnson,et al.  Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor , 2010, 1004.1628.

[17]  Cong Wang,et al.  Experimental evaluation of an adiabiatic quantum system for combinatorial optimization , 2013, CF '13.

[18]  Rishi Saket,et al.  A PTAS for the Classical Ising Spin Glass Problem on the Chimera Graph Structure , 2013, ArXiv.

[19]  Daniel A. Lidar,et al.  Evidence for quantum annealing with more than one hundred qubits , 2013, Nature Physics.