Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1706.07826

Effective optimization using sample persistence: A case study on quantum annealers and various Monte Carlo optimization methods

Hamed Karimi·Gili Rosenberg·Helmut G. Katzgraber
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present and apply a general-purpose, multi-start algorithm for improving the performance of low-energy samplers used for solving optimization problems. The algorithm iteratively fixes the value of a large portion of the variables to values that have a high probability of being optimal. The resulting problems are smaller and less connected, and samplers tend to give better low-energy samples for these problems. The algorithm is trivially parallelizable, since each start in the multi-start algorithm is independent, and could be applied to any heuristic solver that can be run multiple times to give a sample. We present results for several classes of hard problems solved using simulated annealing, path-integral quantum Monte Carlo, parallel tempering with isoenergetic cluster moves, and a quantum annealer, and show that the success metrics as well as the scaling are improved substantially. When combined with this algorithm, the quantum annealer's scaling was substantially improved for native Chimera graph problems. In addition, with this algorithm the scaling of the time to solution of the quantum annealer is comparable to the Hamze--de Freitas--Selby algorithm on the weak-strong cluster problems introduced by Boixo et al. Parallel tempering with isoenergetic cluster moves was able to consistently solve 3D spin glass problems with 8000 variables when combined with our method, whereas without our method it could not solve any.

Explore related subjects

cs.DMcond-mat.dis-nncond-mat.stat-mechphysics.comp-phquant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hamed Karimi, Gili Rosenberg, Helmut G. Katzgraber. 2017-10-28. Effective optimization using sample persistence: A case study on quantum annealers and various Monte Carlo optimization methods. https://doi.org/10.1103/physreve.96.043312

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

UTVPI-representable integer point sets: discrete convexity, polymorphisms, and pairwise closure

We study subsets of the integer lattice represented by single-variable-per-inequality (SVPI), difference-constraint (DC), unit two-variable-per-inequality (UTVPI), and two-variable-per-inequality (TVPI) systems. We relate five viewpoints: inequality representation, discrete convexity, polymorphisms, reconstruction from two-coordinate projections, and fixed points of closure operators. Our central result completely characterizes UTVPI-representability. For every set $S\subseteq\mathbb Z^n$ with $n>1$, \[ \begin{aligned} &S\text{ is UTVPI-representable}\\ &\;\Longleftrightarrow\; S\text{ is closed under the directed midpoint and median operations}\\ &\;\Longleftrightarrow\; S\text{ is integrally convex and $2$-decomposable}. \end{aligned} \] The median condition may instead be replaced by closedness under some majority operation, and the same class is the fixed-point class of a pairwise directed-midpoint closure operator. Thus, all five viewpoints yield equivalent characterizations of UTVPI-representability. In particular, $2$-decomposability is exactly the global condition needed to lift the known two-dimensional equivalence between integral convexity and UTVPI-representability to arbitrary dimension. This theorem is embedded in a broader pairwise-closure theory. For a family $F$ of operations, we define a closure operator by closing every two-coordinate projection under $F$ and joining the resulting sets. Its fixed points are precisely the sets that are both $2$-decomposable and $F$-closed, and we establish a local-to-global criterion for such characterizations. A closed-convex-hull analogue characterizes TVPI-representability. We also characterize SVPI-representability by natural multioperations, prove limitations of operation-based characterizations for several related classes, and determine the complete inclusion hierarchies in the general, Boolean, and two-dimensional settings.

cs.DM↗
arXiv2026

Integrality gap preserving reductions

We propose a framework for the systematic study of integrality gaps of combinatorial optimization problems with respect to a fixed linear programming formulation. The method, called \emph{integrality gap preserving reduction}, consists of iteratively shrinking the input universe of the problem while guaranteeing that gap-maximizing instances remain selected. When the subset of remaining instances becomes specific enough, we calculate the integrality gap explicitly. Besides applying integrality gap preserving reductions to three well-known optimization problems via their standard linear programming formulations (weighted vertex cover problem, multiple knapsack problem, and unrelated machine scheduling problem), we analyse the restricted assignment problem via its configuration LP relaxation. We prove that the integrality gap is equal to $1$ for three ``easy'' subclasses of the problem that are either solvable in polynomial time or admit a PTAS (e.g., the all-one processing time case). For some remaining cases, we improve the current lower bound using our technique.

cs.DM↗
arXiv2026

Paired Disjunctive Domination Number of Middle Graphs

The concept of domination in graphs plays a central role in understanding structural properties and applications in network theory. In this study, we focus on the paired disjunctive domination number in the context of middle graphs, a transformation that captures both adjacency and incidence relations of the original graph. We begin by investigating this parameter for middle graphs of several special graph classes, including path graphs, cycle graphs, wheel graphs, complete graphs, complete bipartite graphs, star graphs, friendship graphs, and double star graphs. We then present general results by establishing lower and upper bounds for the paired disjunctive domination number in middle graphs of arbitrary graphs, with particular emphasis on trees. Additionally, we determine the exact value of the parameter for middle graphs obtained through the join operation. These findings contribute to the broader understanding of domination-type parameters in transformed graph structures and offer new insights into their combinatorial behavior.

cs.DM↗