A subgradient approach for constrained binary optimization via quantum adiabatic evolution

Outer approximation method has been proposed for solving the Lagrangian dual of a constrained binary quadratic programming problem via quantum adiabatic evolution in the literature. This should be an efficient prescription for solving the Lagrangian dual problem in the presence of an ideally noise-f...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Quantum information processing Ročník 16; číslo 8; s. 1 - 21
Hlavní autoři: Karimi, Sahar, Ronagh, Pooya
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.08.2017
Springer Nature B.V
Témata:
Adiabatic flow
Approximation
Coefficients
Constraints
Data Structures and Information Theory
Evolution
Mathematical analysis
Mathematical Physics
Mathematical programming
Microprocessors
Noise prediction
Nonlinear programming
Optimization
Physics
Physics and Astronomy
Quadratic programming
Quantum Computing
Quantum Information Technology
Quantum Physics
Spintronics
Lagrangian duality
Gradient descent
Adiabatic quantum computation
Constrained integer programming
Subgradient method
ISSN:1570-0755, 1573-1332
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Outer approximation method has been proposed for solving the Lagrangian dual of a constrained binary quadratic programming problem via quantum adiabatic evolution in the literature. This should be an efficient prescription for solving the Lagrangian dual problem in the presence of an ideally noise-free quantum adiabatic system. However, current implementations of quantum annealing systems demand methods that are efficient at handling possible sources of noise. In this paper, we consider a subgradient method for finding an optimal primal–dual pair for the Lagrangian dual of a constrained binary polynomial programming problem. We then study the quadratic stable set (QSS) problem as a case study. We see that this method applied to the QSS problem can be viewed as an instance-dependent penalty-term approach that avoids large penalty coefficients. Finally, we report our experimental results of using the D-Wave 2X quantum annealer and conclude that our approach helps this quantum processor to succeed more often in solving these problems compared to the usual penalty-term approaches.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1570-0755
1573-1332
DOI:10.1007/s11128-017-1639-2