Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization

Explore a 12-minute conference talk on the Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization (QUBO) problems, presented by The Julia Programming Language. Delve into the innovative approach that combines quantum algorithms with classical branch-and-bound techniques to overcome limitations in solving QUBO problems. Learn about the implementation using JuMP.jl and QUBO.jl, and how quantum hardware is utilized as a heuristic method in the tree search process. Discover the customized branching rule and optimized embedding techniques used to accelerate algorithm convergence. Gain insights into the performance evaluation conducted on numerous QUBO instances from QUBOLib.jl, comparing the proposed method against Gurobi and hybrid B&B methods with classical heuristic approaches.