arrow
Return

Hybrid Quantum-Classical Heuristic to Solve Large-Scale Integer Linear Programs

delete2023-09-26
delete2
delete
OA
AI
M
Marika Svensson *
M
Martin Andersson
M
Mattias Grönkvist
P
Pontus Vikstål
D
Devdatt Dubhashi
G
Giulia Ferrini
G
Göran Johansson
DOI:10.1103/PhysRevApplied.20.034062delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We present a method that integrates any quantum algorithm capable of finding solutions to integer linear programs into the branch-and-price algorithm, which is regularly used to solve large-scale integer linear programs with a specific structure. The role of the quantum algorithm is to find integer solutions to subproblems appearing in branch-and-price. Obtaining optimal or near-optimal integer solutions to these subproblems can increase the quality of solutions and reduce the depth and branching factor of the branch-and-price algorithm and hence reduce the overall running time. We investigate the viability of the approach by considering the tail assignment problem and the quantum approximate optimization algorithm (QAOA). Here, the master problem is the optimization problem set partitioning or its decision version exact cover and can be expressed as finding the ground state of an Ising spin glass Hamiltonian. For exact cover, our numerical results indicate that the required algorithm depth decreases with the number of feasible solutions for a given success probability of finding a feasible solution. For set partitioning, on the other hand, we find that for a given success probability of finding the optimal solution, the required algorithm depth can increase with the number of feasible solutions if the Hamiltonian is balanced poorly, which in the worst case is exponential in the problem size. We therefore address the significance of properly balancing the objective and constraint parts of the Hamiltonian. We empirically find that the approach is viable with QAOA if polynomial algorithm depth can be realized on quantum devices.
Keywords:
COLUMN GENERATION
ALGORITHM
ASSIGNMENT

Journal

Physical Review Applied cover
Physical Review Applied
IF:
4.4
Papers:
7.1K
Citations:
2.8W

Organization

B
boeing
Scholars:
573
Papers: 470
Citations: 2
C
chalmers university of technology
Scholars:
1.5W
Papers: 1.6W
Citations: 10
J
jeppesen
Scholars:
8
Papers: 7
Citations: 0
researcher View more organizations
Cited Papers

Cited Papers

[8] Animal models for meningitis
err1994-01-01
err0
PREAI
errMartin G. Tauber; André Zwahlen
errShare
errSave
A Market-Based Approach to Optimal Resource Allocation in Integrated-Services Connection-Oriented Networks
err2002-08-01
err0
errOAAI
errPanagiotis Thomas; Demosthenis Teneketzis; Jeffrey K. Mackie-Mason
errShare
errSave
Grover Adaptive Search for Constrained Polynomial Binary Optimization
errQUANTUM
IF5.4
err2021-04-08
err66
errOAAI
errGilliam, Austin; Woerner, Stefan; Gonciulea, Constantin
errShare
errSave
Sclerosing Encapsulating Peritonitis: Early and Late Results of Surgical Management in 32 Cases
err1998-11-16
err0
PREAI
errBetty Célicout; Hugues Levard; Jean-Marie Hay; Simon Msika; Abe Fingerhut; Edouard Pelissier; F French Associations for Surgical Research
errShare
errSave
errShare
errSave
Magnetomechanical effects under torsional strain in iron, cobalt and nickel
err2001-10-01
err0
PREAI
errY. Chen; B.K. Kriegermeier-Sutton; J.E. Snyder; K.W. Dennis; R.W. McCallum; D.C. Jiles
errShare
errSave
researcher View more