The reviewed record of science sign in
Pith

arxiv: 2307.10032 · v1 · pith:DKX3VFX7 · submitted 2023-07-19 · cs.MS · cs.AI

Automatic Conversion of MiniZinc Programs to QUBO

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:DKX3VFX7record.jsonopen to challenge →

classification cs.MS cs.AI
keywords optimisationprocessvariablesautomaticbinaryconstraintminizincproblems
0
0 comments X
read the original abstract

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 process that requires one to remodel all problem variables as binary variables and squeeze the target function and the constraints into a single quadratic polynomial into these new variables. We report here on the basis of our automatic converter from MiniZinc to QUBO, which is able to process a large set of constraint optimisation and constraint satisfaction problems and turn them into equivalent QUBOs, effectively optimising the whole process.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.