A Rigorous Comparison of the D-Wave 2X QPU to Established B-QP Solution Methods
Channel: lanl-ansi
Date: 2017-07-05

Binary Quadratic Programs (BQP) are a challenging class of NP-Hard discrete optimization problems with a wide variety of real-world applications and established solution methods. This work compares the performance of an industrial-strength Integer Programming solver (gurobi), a state-of-the-art Large Neighborhood Search heuristic (HFS), and a D-Wave 2X QPU on five BQP problem classes from the literature. The computational results suggest that the 2X QPU consistently produces high-quality solutions with runtimes that are comparable, but not strictly better than, the established methods. A key conclusion of this work is that further efforts are required to identify challenging problems classes for benchmarking QPUs.

links from the video:
https://arxiv.org/abs/1707.00355
https://github.com/lanl-ansi/dwig
https://github.com/lanl-ansi/bqpjson
https://github.com/lanl-ansi/bqpsolvers

http://aaai.org/Papers/AAAI/1992/AAAI92-071.pdf
https://arxiv.org/abs/1508.05087
https://arxiv.org/abs/1701.04579
https://arxiv.org/abs/1703.00622
https://arxiv.org/abs/1512.02206
https://coursera.org/learn/optimization
https://arxiv.org/pdf/1207.4149.pdf
https://github.com/alex1770/QUBO-Chimera

LA-UR-17-25319