AutoQubo: data-driven automatic QUBO generation
This paper presents a general method to derive automatically a Quadratic Unconstrained Binary Optimisation (QUBO) formulation of, in principle, any combinatorial optimisation problem from its high-level description given in any programming language in a free format. Currently ad-hoc approaches to formulating a problem at a time as a QUBO are the norm. The proposed method goes beyond the state-of-the-art as it is general in its applicability. The method is data-driven and based on sampling, but the obtained QUBO is exact rather than only an approximation of the original problem for optimisation problems occurring in practice. The method is of particular interest in the context of Quantum Ising Machines - quantum computers specialised to optimisation tasks. It can be understood as a compiler that makes these machines usable without specific expertise by automating the translation of high-level description of combinatorial optimisation problems to a low-level format suitable for the quantum hardware.
Code (1)
Similar Papers 제목 키워드 기반
Neural Network Pruning via QUBO Optimization
Neural network pruning can be formulated as a combinatorial optimization problem, yet most existing approaches rely on greedy heuristics that ignore complex interactions between filters. Formal optimization methods such …
Neural Network CompressionImage DenoisingNetwork PruningAutomatic Conversion of MiniZinc Programs to QUBO
Obtaining Quadratic Unconstrained Binary Optimisation models for various optimisation problems, in order to solve those on physical quantum computers (such as the the DWave annealers) is nowadays a lengthy and tedious pr…
Performance-Driven QUBO for Recommender Systems on Quantum Annealers
We propose Counterfactual Analysis Quadratic Unconstrained Binary Optimization (CAQUBO) to solve QUBO problems for feature selection in recommender systems. CAQUBO leverages counterfactual analysis to measure the impact …
counterfactualfeature selectionRecommendation SystemsComputational Performance Bounds Prediction in Quantum Computing with Unstable Noise
Quantum computing has significantly advanced in recent years, boasting devices with hundreds of quantum bits (qubits), hinting at its potential quantum advantage over classical computing. Yet, noise in quantum devices po…
LLM-QUBO: An End-to-End Framework for Automated QUBO Transformation from Natural Language Problem Descriptions
Quantum annealing offers a promising paradigm for solving NP-hard combinatorial optimization problems, but its practical application is severely hindered by two challenges: the complex, manual process of translating prob…