Automatic Conversion of MiniZinc Programs to QUBO

Armin Wolf, Cristian Grozea
7/19/2023
cs.MScs.AI

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{wolf2023automatic,
  title  = {Automatic Conversion of MiniZinc Programs to QUBO},
  author = {Armin Wolf and Cristian Grozea},
  year   = {2023},
  eprint = {2307.10032},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.10032v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.10032.svg)](https://codeofpaper.com/paper/2307.10032)

Discussion