QCI Qbsolv Delivers Strong Classical Performance for Quantum-Ready Formulation

Many organizations that vitally depend on computation for their competitive advantage are keen to exploit the expected performance of quantum computers (QCs) as soon as quantum advantage is achieved. The best approach to deliver hardware quantum advantage for high-value problems is not yet clear. This work advocates establishing quantum-ready applications and underlying tools and formulations, so that software development can proceed now to ensure being ready for quantum advantage. This work can be done independently of which hardware approach delivers quantum advantage first. The quadratic unconstrained binary optimization (QUBO) problem is one such quantum-ready formulation. We developed the next generation of qbsolv, a tool that is widely used for sampling QUBOs on early QCs, focusing on its performance executing purely classically, and deliver it as a cloud service today. We find that it delivers highly competitive results in all of quality (low energy value), speed (time to solution), and diversity (variety of solutions). We believe these results give quantum-forward users a reason to switch to quantum-ready formulations today, reaping immediate benefits in performance and diversity of solution from the quantum-ready formulation,preparing themselves for quantum advantage, and accelerating the development of the quantum computing ecosystem.

[1]  Eldad Haber,et al.  Building an iterative heuristic solver for a quantum annealer , 2015, Computational Optimization and Applications.

[2]  Steven P. Reinhardt,et al.  Partitioning Optimization Problems for Hybrid Classical/Quantum Execution TECHNICAL REPORT , 2017 .

[3]  Michael Booth,et al.  Abstractions considered helpful: A tools architecture for quantum annealers , 2016, 2016 IEEE High Performance Extreme Computing Conference (HPEC).

[4]  Sanjeeb Dash,et al.  A note on QUBO instances defined on Chimera graphs , 2013, ArXiv.

[5]  Catherine C. McGeoch Principles and Guidelines for Quantum Performance Analysis , 2017, QTOP@NetSys.

[6]  E. Farhi,et al.  A Quantum Approximate Optimization Algorithm , 2014, 1411.4028.

[7]  Shinichirou Taguchi,et al.  Quantum Annealing of Vehicle Routing Problem with Time, State and Capacity , 2019, QTOP@NetSys.

[8]  Andrew Lucas,et al.  Ising formulations of many NP problems , 2013, Front. Physics.

[9]  Scott Pakin,et al.  How Will Early Quantum Computing Benefit Computational Methods ? , 2017 .

[10]  David Von Dollen,et al.  Traffic Flow Optimization Using a Quantum Annealer , 2017, Front. ICT.

[11]  Fred W. Glover,et al.  The unconstrained binary quadratic programming problem: a survey , 2014, Journal of Combinatorial Optimization.

[12]  Brian D. Weitzner,et al.  Designing Peptides on a Quantum Computer , 2019, bioRxiv.

[13]  Iain Dunning,et al.  What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO , 2018, INFORMS J. Comput..