Results 61 to 70 of about 18,347 (178)
GPS: A New TSP Formulation for Its Generalizations Type QUBO
Mathematics, 2022 We propose a new Quadratic Unconstrained Binary Optimization (QUBO) formulation of the Travelling Salesman Problem (TSP), with which we overcame the best formulation of the Vehicle Routing Problem (VRP) in terms of the minimum number of necessary ...
Saul Gonzalez-Bermejo +2 more
doaj +1 more source
Quantum-enhanced reinforcement learning for finite-episode games with discrete state spaces
, 2017 Quantum annealing algorithms belong to the class of metaheuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum annealing machines produced by D-Wave Systems, have been ...
Compostella, Gabriele +3 more
core +2 more sources
Rydberg‐Atom Graphs for Quadratic Unconstrained Binary Optimization Problems
Advanced Quantum TechnologiesAbstract There is a growing interest in harnessing the potential of the Rydberg‐atom system to address complex combinatorial optimization challenges. Here an experimental demonstration of how the quadratic unconstrained binary optimization (QUBO) problem can be effectively addressed using Rydberg‐atom graphs is presented.
Andrew Byun +6 more
openaire +2 more sources
Continuous black-box optimization with an Ising machine and random subspace coding
Physical Review Research, 2022 A black-box optimization algorithm such as Bayesian optimization finds the extremum of an unknown function by alternating the inference of the underlying function and optimization of an acquisition function.
Syun Izawa +4 more
doaj +1 more source
Quantum Annealing in the NISQ Era: Railway Conflict Management
Entropy, 2023 We are in the noisy intermediate-scale quantum (NISQ) devices’ era, in which quantum hardware has become available for application in real-world problems. However, demonstrations of the usefulness of such NISQ devices are still rare.
Krzysztof Domino +5 more
doaj +1 more source
How to Approximate any Objective Function via Quadratic Unconstrained Binary Optimization
2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER), 2022 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). We present a toolkit of methods to transform almost arbitrary problems to QUBO by (i) approximating them as a polynomial and then (ii)
Gabor, Thomas (author) +3 more
openaire +3 more sources
Improving Urban Traffic Mobility via a Versatile Quantum Annealing Model
IEEE Transactions on Quantum Engineering, 2023 The growth of cities and the resulting increase in vehicular traffic pose significant challenges to the environment and citizens' quality of life.
Andrea Marchesin +4 more
doaj +1 more source
Frontiers in Computer ScienceJoin order optimization is among the most crucial query optimization problems, and its central position is also evident in the new research field where quantum computing is applied to database optimization and data management.
Valter Uotila
doaj +1 more source
On the Complexity of Local Search in Unconstrained Quadratic Binary Optimization [PDF]
SIAM Journal on Optimization, 2016 Comment: Minor update in 2016: simplified ...
openaire +2 more sources
Efficient rank minimization to tighten semidefinite programming for unconstrained binary quadratic optimization [PDF]
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2017 We propose a method for low-rank semidefinite programming in application to the semidefinite relaxation of unconstrained binary quadratic problems. The method improves an existing solution of the semidefinite programming relaxation to achieve a lower rank solution.
Pogodin, Roman +2 more
openaire +2 more sources