Results 31 to 40 of about 3,222 (193)

QUBO Resolution of the Job Reassignment Problem

open access: yes2023 IEEE 26th International Conference on Intelligent Transportation Systems (ITSC), 2023
Accepted for publication in in 2023 IEEE Symposium Series on Computational Intelligence (SSCI)
Iñigo Pérez Delgado   +3 more
openaire   +2 more sources

Approximate Approximation on a Quantum Annealer

open access: yes, 2020
Many problems of industrial interest are NP-complete, and quickly exhaust resources of computational devices with increasing input sizes. Quantum annealers (QA) are physical devices that aim at this class of problems by exploiting quantum mechanical ...
Feld, Sebastian   +5 more
core   +1 more source

Qubo model for the Closest Vector Problem

open access: yesCoRR, 2023
In this paper we consider the closest vector problem (CVP) for lattices $Λ\subseteq \mathbb{Z}^n$ given by a generator matrix $A\in \mathcal{M}_{n\times n}(\mathbb{Z})$. Let $b>0$ be the maximum of the absolute values of the entries of the matrix $A$.
Eduardo Canale   +2 more
openaire   +2 more sources

QuASeR -- Quantum Accelerated De Novo DNA Sequence Reconstruction

open access: yes, 2020
In this article, we present QuASeR, a reference-free DNA sequence reconstruction implementation via de novo assembly on both gate-based and quantum annealing platforms.
Al-Ars, Zaid   +2 more
core   +1 more source

Towards Prediction of Financial Crashes with a D-Wave Quantum Computer [PDF]

open access: yes, 2019
Prediction of financial crashes in a complex financial network is known to be an NP-hard problem, i.e., a problem which cannot be solved efficiently with a classical computer.
Enrique Lizaso   +9 more
core   +2 more sources

Flight Gate Assignment with a Quantum Annealer [PDF]

open access: yes, 2018
Optimal flight gate assignment is a highly relevant optimization problem from airport management. Among others, an important goal is the minimization of the total transit time of the passengers.
A Haghani   +6 more
core   +4 more sources

Analysis of the relation between quadratic unconstrained binary optimization and the spin-glass ground-state problem

open access: yesPhysical Review Research, 2019
We analyze the transformation of quadratic unconstrained binary optimization (QUBO) from its conventional Boolean presentation into an equivalent spin-glass problem with coupled ±1 spin variables exposed to a site-dependent external field.
Stefan Boettcher
doaj   +1 more source

Quantum-enhanced reinforcement learning for finite-episode games with discrete state spaces

open access: yes, 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

A QUBO formulation for top-τ eigencentrality nodes

open access: yesPLOS ONE, 2022
The efficient calculation of the centrality or “hierarchy” of nodes in a network has gained great relevance in recent years due to the generation of large amounts of data. The eigenvector centrality (aka eigencentrality) is quickly becoming a good metric for centrality due to both its simplicity and fidelity.
Prosper D. Akrobotu   +3 more
openaire   +4 more sources

Optimizing Heat Treatment Schedules via QUBO Formulation

open access: yesApplied Sciences
Quadratic Unconstrained Binary Optimization (QUBO) is the problem of finding binary variable assignments that minimize a given quadratic objective function.
Ikuto Nakatsukasa   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy