paper-with-me

홈 › Papers

Analysis of the Relation between Quadratic Unconstrained Binary Optimization (QUBO) and the Spin Glass Ground-State Problem

2019-06-24 · Stefan Boettcher

We analyze the transformation of QUBO from its conventional Boolean presentation into an equivalent spin glass problem with coupled $\pm1$ spin variables exposed to a site-dependent external field. We find that in a widely used testbed for QUBO these fields tend to be rather large compared to the typical coupling and many spins in each optimal configurations simply align with the fields irrespective of their constraints. Thereby, the testbed instances tend to exhibit large redundancies - seemingly independent variables which contribute little to the hardness of the problem, however. We demonstrate various consequences of this insight, for QUBO solvers as well as for heuristics developed for finding spin glass ground states. To this end, we implement the Extremal Optimization (EO) heuristic, in a new adaptation for the QUBO problem. We also propose a novel way to assess the quality of heuristics for increasing problem sizes based on asymptotic scaling.

📄 PDF Abstract BibTeX arXiv:1906.10036

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Constraint Programming to Discover One-Flip Local Optima of Quadratic Unconstrained Binary Optimization Problems

2021-04-04 · Amit Verma, Mark Lewis

The broad applicability of Quadratic Unconstrained Binary Optimization (QUBO) constitutes a general-purpose modeling framework for combinatorial optimization problems and are a required format for gate array and quantum …

Combinatorial Optimization

A Diversified Multi-Start Algorithm for Unconstrained Binary Quadratic Problems Leveraging the Graphics Processor Unit

2017-05-31 · Mark W. Lewis

Multi-start algorithms are a common and effective tool for metaheuristic searches. In this paper we amplify multi-start capabilities by employing the parallel processing power of the graphics processer unit (GPU) to quic…

GPU

Goal Seeking Quadratic Unconstrained Binary Optimization

2021-03-24 · Amit Verma, Mark Lewis

The Quadratic Unconstrained Binary Optimization (QUBO) modeling and solution framework is a requirement for quantum and digital annealers. However optimality for QUBO problems of any practical size is extremely difficult…

Decision Making

Efficient correlation-based discretization of continuous variables for annealing machines

2023-01-18 · Yuki Furue, Makiko Konoshima, Hirotaka Tamura, Jun Ohkubo

Annealing machines specialized for combinatorial optimization problems have been developed, and some companies offer services to use those machines. Such specialized machines can only handle binary variables, and their i…

Combinatorial Optimization

An encoding of argumentation problems using quadratic unconstrained binary optimization

2024-09-09 · Marco Baioletti, Francesco Santini

In this paper, we develop a way to encode several NP-Complete problems in Abstract Argumentation to Quadratic Unconstrained Binary Optimization (QUBO) problems. In this form, a solution for a QUBO problem involves minimi…

Abstract Argumentation