Results 91 to 100 of about 2,283 (206)
Clustering-Based Sub-QUBO Extraction for Hybrid QUBO Solvers
Quantum Approximate Optimization Algorithm (QAOA) can be used to solve quadratic unconstrained binary optimization (QUBO) problems. However, the size of the solvable problem is limited by the number of qubits. To leverage noisy intermediate-scale quantum (NISQ) devices to solve large-scale QUBO problems, one possible way is to decompose the full ...
Zhao, Wending, Tang, Gaoxiang
openaire +2 more sources
Cluster-based Index Tracking Via QUBO and Digital Annealing [PDF]
, 2021 The cardinality constrained index-tracking problem seeks to find a combination of financial assets to replicate the return of a broad market index while using only a small subset of the asset universe.
Hong, Seo Woo
core
Computationally challenging combinatorial optimization problems (COPs) play a fundamental role in various applications. To tackle COPs, many Ising machines and Quadratic Unconstrained Binary Optimization (QUBO) solvers have been proposed, which typically
Yang, Zeyu +5 more
core +2 more sources
Machine Learning: Science and TechnologyQuadratic unconstrained binary optimization (QUBO) is at the heart of many industries and academic fields such as logistics, supply chain, finance, pharmaceutical science, chemistry, IT, and energy sectors, among others (Bangert 2012 Optimization for ...
Chia-Tso Lai +3 more
doaj +1 more source
QUBO Formulation of the Pickup and Delivery Problem with Time Windows for Quantum Annealing
Applied SciencesThis paper addresses the Pickup and Delivery Problem with Time Windows (PDPTW), an NP-hard combinatorial optimization problem with major practical relevance in logistics and transportation.
Cosmin Ștefan Curuliuc, Florin Leon
doaj +1 more source
Range dependent Hamiltonian algorithms for numerical QUBO formulation
Scientific ReportsWith the advent and development of quantum computers, various quantum algorithms that can solve linear equations and eigenvalues faster than classical computers have been developed.
Hyunju Lee, Kyungtaek Jun
doaj +1 more source
Ising Machine Approach to the Lecturer–Student Assignment Problem
IEEE AccessIsing machines are efficient solvers for combinatorial optimization problems (COPs). After mapping COPs to Quadratic Unconstrained Binary Optimization (QUBO) problems, Ising machines search for the lowest energy solution of the QUBO corresponding to the ...
Sora Tomita +2 more
doaj +1 more source
A Simple QUBO Formulation of Sudoku
Proceedings of the Genetic and Evolutionary Computation Conference CompanionThis article describes how to solve Sudoku puzzles using Quadratic Unconstrained Binary Optimization (QUBO). To this end, a QUBO instance with 729 variables is constructed, encoding a Sudoku grid with all constraints in place, which is then partially assigned to account for clues.
openaire +2 more sources
QUBOLite: A lightweigth Python toolkit for QUBO
CoRRWe present QUBOLite, a Python package for the creation, manipulation, analysis, and solution of Quadratic Unconstrained Binary Optimization (QUBO) instances. Built as a thin wrapper around NumPy arrays, QUBOLite combines efficient numerical operations with high-level abstractions for tasks ranging from instance generation to preprocessing, analysis ...
Sascha Mücke +3 more
openaire +2 more sources
Quantum Annealing Approach for the Optimal Real-time Traffic Control using QUBO [PDF]
Traffic congestion is one of the major issues in urban areas, particularly when traffic loads exceed the roads capacity, resulting in higher petrol consumption and carbon emissions as well as delays and stress for road users.
Singh, Amit +3 more
core +1 more source