mlsanityData to 14 Oct 2026

Automatic Conversion of MiniZinc Programs to QUBO

arXiv 2307.10032 ↗First posted 19 Jul 2023cs.MS cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 6 references that are in the map. First posted on arXiv 19 Jul 2023.

Builds on

2 of 6 references.

References · 2

  1. 2013Ising formulations of many NP problemscited by 207
  2. 2017Practical Integer-to-Binary Mapping for Quantum Annealerscited by 1

Built on by

Not cited yet.