How do you encode combinatorial optimization problems when they have inequality constraints on quantum computers? well, the usual approach is using slack variables. But, this approach is quite expensive and makes the search for possible solutions even harder. In this work, https://arxiv.org/abs/2211.13914, we present “unbalanced penalization” a new approach to encode the inequality constraints of combinatorial optimization problems.

A teeny tiny demo of how to publish your code on GitLab to Zenodo, following good practices with Citation File Format and CI/CD.

⚠️ NOTE :: THIS DOES NOT WORK YET :: NOTE ⚠️

Datasets, Transforms and Models specific to Computer Vision

Repo to hold ansible-files that shall be used for automatic creation/configuration of hosts (e.g. gitlab-runners)