Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization [PDF]
Recently, inspired by quantum annealing, many solvers specialized for unconstrained binary quadratic programming problems have been developed. For further improvement and application of these solvers, it is important to clarify the differences in their ...
Hiroki Oshiyama, Masayuki Ohzeki
doaj +6 more sources
Quadratic unconstrained binary optimization and constraint programming approaches for lattice-based cyclic peptide docking [PDF]
The peptide-protein docking problem is an important problem in structural biology that facilitates rational and efficient drug design. In this work, we explore modeling and solving this problem with the quantum-amenable quadratic unconstrained binary ...
J. Kyle Brubaker +6 more
doaj +5 more sources
On the hardness of quadratic unconstrained binary optimization problems [PDF]
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.
V. Mehta +7 more
doaj +6 more sources
Sampling electronic structure quadratic unconstrained binary optimization problems (QUBOs) with Ocean and Mukai solvers. [PDF]
The most advanced D-Wave Advantage quantum annealer has 5000+ qubits, however, every qubit is connected to a small number of neighbors. As such, implementation of a fully-connected graph results in an order of magnitude reduction in qubit count.
Alexander Teplukhin +4 more
doaj +3 more sources
Quadratic unconstrained binary optimization for environmental control system equipment design and assessment [PDF]
This paper explores possible implementations of a quantum annealing-based algorithm, in the Quadratic unconstrained binary optimization method (QUBO) form, to solve the thermo-fluid dynamics problem associated with the design of critical components of ...
Giulio Malinverno, Javier Blasco Alberto
doaj +3 more sources
Efficient digital quadratic unconstrained binary optimization solvers for SAT problems [PDF]
Boolean satisfiability (SAT) is a propositional logic problem of determining whether an assignment of variables satisfies a Boolean formula. Many combinatorial optimization problems can be formulated in Boolean SAT logic—either as k -SAT decision ...
Robert Simon Fong +2 more
doaj +4 more sources
Diversifying Investments and Maximizing Sharpe Ratio: A Novel Quadratic Unconstrained Binary Optimization Formulation [PDF]
The optimization of investment portfolios represents a pivotal task within the field of financial economics. Its objective is to identify asset combinations that meet specified criteria for return and risk.
Mirko Mattesi +6 more
doaj +3 more sources
Goal seeking Quadratic Unconstrained Binary Optimization
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 to achieve.
Amit Verma, Mark Lewis
doaj +2 more sources
How to Approximate any Objective Function via Quadratic Unconstrained Binary Optimization [PDF]
Quadratic unconstrained binary optimization (QUBO) has become the standard format for optimization using quantum computers, i.e., for both the quantum approximate optimization algorithm (QAOA) and quantum annealing (QA).
Thomas Gabor +3 more
openalex +3 more sources
Quadratic Unconstrained Binary Optimization for the Automotive Paint Shop Problem
The Binary Paint Shop Problem (BPSP) is a combinatorial optimization problem which draws inspiration from the automotive paint shop. Its binary nature, making it a good fit for Quadratic Unconstrained Binary Optimization (QUBO) solvers, has been well ...
Pieter Debevere +2 more
doaj +2 more sources

