Results 21 to 30 of about 2,742,325 (160)
A continuous reformulation of the quadratic unconstrained binary optimization problem [PDF]
In this paper we consider the Quadratic Unconstrained Binary Optimization (QUBO) Problem. Using a suitable function and penalty parameter we can reformulate the original QUBO problem as a continuous program. It is shown that the problem of large size can
ZAPOROJAN, Sergiu, MORARU, Vasile
core +1 more source
Quadratic unconstrained binary optimization (QUBO) is a classic NP-hard problem with an enormous number of applications. Local search strategy (LSS) is one of the most fundamental algorithmic concepts and has been successfully applied to a wide range of ...
Bahram Alidaee, Lutfu S. Sua, Haibo Wang
core +1 more source
Quantum Approximate Optimization Algorithm (QAOA) is one of the most short-term promising quantum-classical algorithm to solve unconstrained combinatorial optimization problems.
Lavignac, Marion +3 more
core +4 more sources
Ising machines, including quantum annealing machines, are promising next-generation computers for combinatorial optimization problems. However, due to hardware limitations, most Ising-type hardware can only solve objective functions expressed in linear ...
Kazuki Ikeuchi +2 more
doaj +1 more source
On good encodings for quantum annealer and digital optimization solvers
Several optimization solvers inspired by quantum annealing have been recently developed, either running on actual quantum hardware or simulating it on traditional digital computers.
Alberto Ceselli, Marco Premoli
doaj +1 more source
Data-driven, multi-objective QUBO-based optimization for multi-phase alloy design [PDF]
Here, we present two complementary approaches that advance quadratic unconstrained binary optimization (QUBO) toward practical use in data-driven materials design and other real-valued black-box optimization tasks.
Thomas Plehn +4 more
doaj +1 more source
Abstract Argumentation Goes Quantum: An Encoding to QUBO Problems
We present an encoding of some NP-Complete problems in Abstract Argumentation to Quadratic Unconstrained Binary Optimization (QUBO) problems. A solution for a QUBO problem corresponds to minimize a quadratic function over binary variables (0/1), whose ...
Marco Baioletti, Francesco Santini
core +1 more source
Solving (Max) 3-SAT via Quadratic Unconstrained Binary Optimization
We introduce a novel approach to translate arbitrary 3-SAT instances to Quadratic Unconstrained Binary Optimization (QUBO) as they are used by quantum annealing (QA) or the quantum approximate optimization algorithm (QAOA).
Nüßlein, Jonas +4 more
core
RinQ: Towards predicting central sites in proteins on current quantum computers
We introduce RinQ, a hybrid quantum–classical framework for identifying functionally critical residues in proteins by formulating centrality detection as a Quadratic Unconstrained Binary Optimization (QUBO) problem.
Shah Ishmam Mohtashim
doaj +1 more source
On the hardness of quadratic unconstrained binary optimization problems
We use exact enumeration to characterize the solutions of quadratic unconstrained binary optimization problems of less than 21 variables in terms of their distributions of Hamming distances to close-by solutions.
Jin, Fengping +3 more
core

