Recherche

We introduce Sampled-Based Guided Quantum Walk (SamBa–GQW), a novel quantum algorithm for approximating solutions of binary combinatorial optimization

The first question when deploying a program synthesis approach is the design of the target programming language, called domain-specific language (DSL)

**Orbit-finite linear programming** An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely

/Exposé /Talk/ We introduce the problem of Matroid-Constrained Vertex Cover: given a graph with weights on the edges and a matroid imposed on the

(Uniquement en présentiel / Only offline, no online version) We introduce a limit theory for Latin squares, paralleling the recent limit theories of

I am interested in verification of distributed systems with an unbounded number of agents running the same finite-state program. These include systems

A round-table session: each person will tell in five minutes about the current research projects / interests, maybe including the wishes for starting

/Exposé en français/Talk in french / English slides / transparents en anglais In this talk, I will given a rather simple construction of a graph U n

/Exposé en anglais/Talk in english/ Given n points in the plane, a spanning tree is a set of n-1 straight line edges connecting them while inducing a

We study the notion of k-stabilizer universal quantum state, that is, an n-qubit quantum state, such that it is possible to induce any stabilizer