- 专利标题: Method and system for solving the Lagrangian dual of a constrained binary quadratic programming problem using a quantum annealer
-
申请号: US18047882申请日: 2022-10-19
-
公开(公告)号: US11989256B2公开(公告)日: 2024-05-21
- 发明人: Pooya Ronagh , Ehsan Iranmanesh , Brad Woods
- 申请人: 1QB INFORMATION TECHNOLOGIES INC.
- 申请人地址: CA Vancouver
- 专利权人: 1QB INFORMATION TECHNOLOGIES INC.
- 当前专利权人: 1QB INFORMATION TECHNOLOGIES INC.
- 当前专利权人地址: CA Vancouver
- 代理机构: Wilson Sonsini Goodrich & Rosati
- 优先权: CA 2881033 2015.02.03
- 主分类号: G06F17/11
- IPC分类号: G06F17/11 ; G06N5/01 ; G06N10/00
摘要:
A method is disclosed for solving the Lagrangian dual of a constrained binary quadratic programming problem. The method comprises obtaining a constrained quadratic binary programming problem; until a convergence is detected, iteratively, performing a Lagrangian relaxation of the constrained quadratic binary programming problem to provide an unconstrained quadratic binary programming problem, providing the unconstrained quadratic binary programming problem to a quantum annealer, obtaining from the quantum annealer at least one corresponding solution, using the at least one corresponding solution to generate a new approximation for the Lagrangian dual bound; and providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem after convergence.
公开/授权文献
信息查询