Quantum approximate multi-objective optimization. [PDF]
Kotil A +6 more
europepmc +1 more source
Harnessing Quantum Computing for Energy Materials: Opportunities and Challenges. [PDF]
Kim S +5 more
europepmc +1 more source
Digital Annealer for quadratic unconstrained binary optimization: A comparative performance analysis
Digital Annealer (DA) is a computer architecture designed for tackling combinatorial optimization problems formulated as quadratic unconstrained binary optimization (QUBO) models. In this paper, we present the results of an extensive computational study to evaluate the performance of DA in a systematic way in comparison to multiple state-of-the-art ...
Oylum Şeker, Merve Bodur
exaly +3 more sources
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis [PDF]
The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying model for representing a wide range of combinatorial optimization problems, and for linking a variety of disciplines that face these problems. A new class of quantum annealing computer that maps QUBO onto a physical qubit network structure with specific size and edge ...
Mark Lewis, Fred Glover
exaly +3 more sources
Extremal Optimization for Quadratic Unconstrained Binary Problems
AbstractWe present an implementation of τ-EO for quadratic unconstrained binary optimization (QUBO) problems. To this end, we transform modify QUBO from its conventional Boolean presentation into a spin glass with a random external field on each site.
Stefan Boettcher
exaly +2 more sources
Related searches:
High‐throughput FPGA implementation for quadratic unconstrained binary optimization
Concurrency and Computation: Practice and Experience, 2021AbstractQuadratic unconstrained binary optimization (QUBO) is a combinatorial optimization problem. Since various NP‐hard problems such as the traveling salesman problem can be formulated as a QUBO instance, QUBO is used with a wide range of applications.
Hiroshi Kagawa +8 more
openaire +1 more source
Probabilistic reasoning as quadratic unconstrained binary optimization
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2022Probabilistic reasoning is an important tool for using uncertainty in AI, especially for automated reasoning. Partial probability assessments are a way of expressing partial probabilistic knowledge on a set of events. These assessments contain only the information about "interesting"events (hence it can be easily assessed by an expert).
openaire +2 more sources
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)
Journal of Heuristics, 2007We present a family of local-search-based heuristics for Quadratic Unconstrained Binary Optimization (QUBO), all of which start with a (possibly fractional) initial point, sequentially improving its quality by rounding or switching the value of one variable, until arriving to a local optimum. The effects of various parameters on the efficiency of these
Endre Boros, Peter L Hammer
exaly +2 more sources
A Collaborative Neurodynamic Algorithm for Quadratic Unconstrained Binary Optimization
IEEE Transactions on Emerging Topics in Computational IntelligenceHongzong Li, Jun Wang
exaly +2 more sources
Quadratic Unconstrained Binary Optimization (QUBO) on neuromorphic computing system
2017 International Joint Conference on Neural Networks (IJCNN), 2017The problems of Artificial intelligence (AI) naturally maps to NP-hard optimization problems. This trend has significance to achieve human-level computation capability from machines. This computational ability can be achieved by developing evolutionary algorithms or mapping those evolutionary algorithms onto new generation computing systems: Quantum or
Md. Zahangir Alom +4 more
openaire +1 more source

