Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization [PDF]
Scientific Reports, 2022 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 +2 more sources
Goal seeking Quadratic Unconstrained Binary Optimization
Results in Control and Optimization, 2022 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 +3 more sources
Sampling electronic structure quadratic unconstrained binary optimization problems (QUBOs) with Ocean and Mukai solvers. [PDF]
PLoS ONE, 2022 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 +2 more sources
Quadratic unconstrained binary optimization and constraint programming approaches for lattice-based cyclic peptide docking [PDF]
Scientific ReportsThe 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 +2 more sources
Solving Flexible Job-Shop Scheduling Problems Based on Quantum Computing [PDF]
EntropyFlexible job-shop scheduling problems (FJSPs) represent one of the most complex combinatorial optimization challenges. Modern production systems and control processes demand rapid decision-making in scheduling.
Kaihan Fu +3 more
doaj +2 more sources
RisksIn this paper, we consider the inclusion of the solvency capital requirement (SCR) into portfolio optimization by the use of a quadratic proxy model. The Solvency II directive requires insurance companies to calculate their SCR based on the complete loss
Ivica Turkalj +8 more
doaj +3 more sources
Efficient bit labeling in factorization machines with annealing for traveling salesman problem [PDF]
Scientific ReportsTo efficiently determine an optimum parameter combination in a large-scale problem, it is essential to convert the parameters into available variables in actual machines. Specifically, quadratic unconstrained binary optimization problems are solved using
Shota Koshikawa +2 more
doaj +2 more sources
Analyzing Quadratic Unconstrained Binary Optimization Problems Via Multicommodity Flows. [PDF]
Discrete Appl Math, 2009 Wang D, Kleinberg RD.
europepmc +2 more sources
Parity Quantum Optimization: Compiler [PDF]
Quantum, 2023 We introduce parity quantum optimization with the aim of solving optimization problems consisting of arbitrary $k$-body interactions and side conditions using planar quantum chip architectures.
Kilian Ender +4 more
doaj +1 more source
Grover Adaptive Search for Constrained Polynomial Binary Optimization [PDF]
Quantum, 2021 In this paper we discuss Grover Adaptive Search (GAS) for Constrained Polynomial Binary Optimization (CPBO) problems, and in particular, Quadratic Unconstrained Binary Optimization (QUBO) problems, as a special case.
Austin Gilliam +2 more
doaj +1 more source