US 11,989,256 B2
Method and system for solving the Lagrangian dual of a constrained binary quadratic programming problem using a quantum annealer
Pooya Ronagh, Vancouver (CA); Ehsan Iranmanesh, Burnaby (CA); and Brad Woods, Vancouver (CA)
Assigned to 1QB INFORMATION TECHNOLOGIES INC., Vancouver (CA)
Filed by 1QB INFORMATION TECHNOLOGIES INC., Vancouver (CA)
Filed on Oct. 19, 2022, as Appl. No. 18/047,882.
Application 18/047,882 is a continuation of application No. 16/809,473, filed on Mar. 4, 2020, granted, now 11,514,134.
Application 16/809,473 is a continuation of application No. 15/014,576, filed on Feb. 3, 2016, abandoned.
Claims priority of application No. CA 2881033 (CA), filed on Feb. 3, 2015.
Prior Publication US 2023/0222173 A1, Jul. 13, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 17/11 (2006.01); G06N 5/01 (2023.01); G06N 10/00 (2022.01)
CPC G06F 17/11 (2013.01) [G06N 5/01 (2023.01); G06N 10/00 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A method for solving a computational problem comprising a Lagrangian dual of a binary polynomially constrained polynomial programming problem, the method comprising:
(a) providing, at a digital computer, said binary polynomially constrained polynomial programming problem;
(b) using said digital computer to obtain an unconstrained binary quadratic programming problem representative of a Lagrangian relaxation of said binary polynomially constrained polynomial programming problem at a set of Lagrange multipliers;
(c) using said digital computer to direct said unconstrained binary quadratic programming problem to a binary optimizer over a communications network for executing said unconstrained binary quadratic programming problem;
(d) using said digital computer to obtain from said binary optimizer at least one solution corresponding to said unconstrained binary quadratic programming problem;
(e) using said digital computer to generate an updated set of Lagrange multipliers using said at least one solution corresponding to said unconstrained binary quadratic programming problem; and
(f) using said digital computer to output a report indicative of at least one solution of said binary polynomially constrained polynomial programming problem based on said updated set of Lagrange multipliers.