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
Quadratic Unconstrained Binary Optimization Approach for Incorporating Solvency Capital into Portfolio Optimization [PDF]
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 +2 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
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
Performance Comparison of Typical Binary-Integer Encodings in an Ising Machine
IEEE Access, 2021 The differences in performance among binary-integer encodings in an Ising machine, which can solve combinatorial optimization problems, are investigated.
Kensuke Tamura +4 more
doaj +1 more source
Quantum Algorithms for Mixed Binary Optimization Applied to Transaction Settlement
IEEE Transactions on Quantum Engineering, 2021 In this article, we extend variational quantum optimization algorithms for quadratic unconstrained binary optimization problems to the class of mixed binary optimization problems.
Lee Braine +3 more
doaj +1 more source
Qubit Reduction and Quantum Speedup for Wireless Channel Assignment Problem
IEEE Transactions on Quantum Engineering, 2023 In this article, we propose a novel method of formulating an NP-hard wireless channel assignment problem as a higher-order unconstrained binary optimization (HUBO), where the Grover adaptive search (GAS) is used to provide a quadratic speedup for solving
Yuki Sano +2 more
doaj +1 more source
Quadratic Unconstrained Binary Optimization via Quantum-Inspired Annealing
Physical Review Applied, 2022 We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. The algorithm can be seen as an analogue of quantum annealing under the restriction of a product state space, where the dynamical evolution in quantum annealing is replaced with a gradient-descent based method. This formulation is
Bowles, Joseph +4 more
openaire +2 more sources
Greedy permanent magnet optimization
Nuclear Fusion, 2023 A number of scientific fields rely on placing permanent magnets in order to produce a desired magnetic field. We have shown in recent work that the placement process can be formulated as sparse regression.
Alan A. Kaptanoglu +2 more
doaj +1 more source