Results 11 to 20 of about 3,222 (193)
QUBO Modeling for a Spectrum of Domination Problems
As quantum computing advances, the application of quantum algorithms to address combinatorial optimization problems on quantum computers has emerged as a pivotal area of research.
Haoqian Pan, Changhong Lu
doaj +3 more sources
Derivation of QUBO Formulations for Sparse Estimation [PDF]
We propose a quadratic unconstrained binary optimization (QUBO) formulation of the l1-norm, which enables us to perform sparse estimation of Ising-type annealing methods such as quantum annealing. The QUBO formulation is derived using the Legendre transformation and the Wolfe theorem, which have recently been employed to derive the QUBO formulations of
Tomohiro Yokota +3 more
openaire +2 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 +1 more source
Application of QUBO solver using black-box optimization to structural design for resonance avoidance
Quadratic unconstrained binary optimization (QUBO) solvers can be applied to design an optimal structure to avoid resonance. QUBO algorithms that work on a classical or quantum device have succeeded in some industrial applications.
Tadayoshi Matsumori +2 more
doaj +1 more source
HUBO and QUBO models for prime factorization
AbstractThe security of the RSA cryptosystem is based on the difficulty of factoring a large number N into prime numbers $$p$$ p and $$q$$ q satisfying $$N=p\times q$$ N = p ×
Kyungtaek Jun, Hyunju Lee
openaire +4 more sources
Strategic Portfolio Optimization Using Simulated, Digital, and Quantum Annealing
In this work, we introduce a new workflow to solve portfolio optimization problems on annealing platforms. We combine a classical preprocessing step with a modified unconstrained binary optimization (QUBO) model and evaluate it using simulated annealing (
Jonas Lang +2 more
doaj +1 more source
Quantum annealing is a global optimization algorithm that uses the quantum tunneling effect to speed-up the search for an optimal solution. Its current hardware implementation relies on D-Wave’s Quantum Processing Units, which are limited in terms of ...
Sizhuo Yu, Sizhuo Yu, Tahar Nabil
doaj +1 more source
A QUBO formulation for the Tree Containment problem
Phylogenetic (evolutionary) trees and networks are leaf-labeled graphs that are widely used to represent the evolutionary relationships between entities such as species, languages, cancer cells, and viruses. To reconstruct and analyze phylogenetic networks, the problem of deciding whether or not a given rooted phylogenetic network embeds a given rooted
Michael J. Dinneen +2 more
openaire +3 more sources
Cinco cosas que le pido al BIM, una reflexión profesional y docente
La forma en que se generaba documentación gráfica para la construcción de edificios no volvió a ser la misma desde la introducción del CAD -Computer Aided Design /Diseño Asistido por Ordenador hace más de tres décadas. Ahora, con la inminente/inexcusable
David Valverde Cantero +1 more
doaj +1 more source
Trip Planning Based on subQUBO Annealing
The trip planning problem (TPP) can be formulated as a combinatorial optimization problem that searches for the best route to visit a series of landmarks and hotels.
Tatsuya Noguchi +3 more
doaj +1 more source

