Results 61 to 70 of about 2,283 (206)
Abstract In previous chapters, we already came across an instance of a quadratic unconstrained binary optimization problem or QUBO for short. In this chapter, we will now widen our perspective on QUBOs as our major plot line in this book is that any QUBO can be solved by running a Hopfield net and that any problem that can be solved ...
Christian Bauckhage, Rafet Sifa
openaire +1 more source
Mapping Quantum Circuits to Modular Architectures with QUBO
Submitted to IEEE QCE ...
Bandic, Medina +10 more
openaire +3 more sources
Table of Networkx and QUBO results with τ = 1 and τ = 5.
Table of Networkx and QUBO results with τ = 1 and τ = 5.
Tamsin E. James (13046831) +3 more
core +1 more source
Standardization of Multi-Objective QUBOs
Multi-objective optimization involving Quadratic Unconstrained Binary Optimization (QUBO) problems arises in various domains. A fundamental challenge in this context is the effective balancing of multiple objectives, each potentially operating on very different scales. This imbalance introduces complications such as the selection of appropriate weights
Loong Kuan Lee +2 more
openaire +3 more sources
This work investigates the optimal initial data size for surrogate‐based active learning in functional material optimization. Using factorization machine (FM)‐based quadratic unconstrained binary optimization (QUBO) surrogates and averaged piecewise linear regression, we show that adequate initial data accelerates convergence, enhances efficiency, and ...
Seongmin Kim, In‐Saeng Suh
wiley +1 more source
A QUBO Framework for Team Formation
The team formation problem assumes a set of experts and a task, where each expert has a set of skills and the task requires some skills. The objective is to find a set of experts that maximizes coverage of the required skills while simultaneously minimizing the costs associated with the experts.
Karan Vombatkere +2 more
openaire +4 more sources
Quantum Spectral Clustering Framework via Compact Circuit Structures
Can a quantum computer cluster data without ever reading the full kernel? This work shows that compact, parameterized circuits estimate the Laplacian quadratic forms directly and perform clustering, without explicitly constructing the full quantum fidelity‐kernel matrix.
Hyeong‐gyu Kim +2 more
wiley +1 more source
Applying Ising Machines to Multi-objective QUBOs
Multi-objective optimisation problems involve finding solutions with varying trade-offs between multiple and often conflicting objectives. Ising machines are physical devices that aim to find the absolute or approximate ground states of an Ising model.
Mayowa Ayodele +4 more
openaire +5 more sources
ABSTRACT Quantum annealing is emerging as a practical tool for large‐scale combinatorial optimization. We map continuum displacements and element densities to binary variables, turning both deformation analysis and topology optimization into quadratic unconstrained binary optimization (QUBO) problems that run on today's annealers.
Rio Honda +5 more
wiley +1 more source
QUBO formulations for a system of linear equations
Abstract With the advent of quantum computers, many quantum computing algorithms are being developed. Solving linear systems is one of the most fundamental problems in almost all of science and engineering. Harrow-Hassidim-Lloyd algorithm, a monumental quantum algorithm for solving linear systems on the gate model quantum computers, was ...
openaire +2 more sources

