Benchmarking qubo solvers using generated problems with known solutions
AssigneeDell Products L.P.
InventorsMiguel Paredes Quiñones, Brendan Burns Healy
Life of this patent
Estimating the term…
Abstract
One example method includes creating a random matrix Q that defines a quadratic unconstrained binary optimization problem (QUBO) that has a known, optimal, solution, transmitting the random matrix Q to each solver in a group that includes multiple solvers, obtaining, from each of the solvers, a respective solution to the QUBO problem, benchmarking the solvers by comparing each of the solutions to the known, optimal solution and, based on the comparing, identifying a best solver from among the solvers in the group.
Claims16
A method, comprising:
- creating a random matrix Q that defines a benchmark quadratic unconstrained binary optimization problem (QUBO) that has a known, optimal, solution;
- transmitting the random matrix Q to each solver in a group that includes multiple solvers;
- obtaining, from each of the solvers, a respective solution to the benchmark QUBO problem;
- benchmarking the solvers by comparing each of the solutions to the known, optimal solution;
- and
- based on the comparing, identifying a best solver from among the solvers in the group.
A non-transitory storage medium having stored therein instructions that are executable by one or more hardware processors to perform operations comprising:
- creating a random matrix Q that defines a benchmark quadratic unconstrained binary optimization problem (QUBO) that has a known, optimal, solution;
- transmitting the random matrix Q to each solver in a group that includes multiple solvers;
- obtaining, from each of the solvers, a respective solution to the benchmark QUBO problem;
- benchmarking the solvers by comparing each of the solutions to the known, optimal solution;
- and
- based on the comparing, identifying a best solver from among the solvers in the group.
Dependencies are inferred from the claim text.