Recherche
We propose a novel variational ansatz for the ground-state preparation of the ℤ2 lattice gauge theory (LGT) in quantum simulators. It combines
On the one hand, the use of graphical language in quantum computing for the representation of algorithms, although intuitive, is not very useful for
** Enumeration Classes Defined by Circuits ** We refine the complexity landscape for enumeration problems by introducing very low classes defined by
**Enumerating Regular Languages in Bounded Delay** We study the task, for a given language L, of enumerating the (generally infinite) sequence of its
The distributed version of the Ramadge and Wonham control problem asks for the existence of a correct controller of a plant modeled as an asynchronous
Discrete-time Dynamical Systems (DS) are a popular framework for modeling biological processes. However, the increasing number of DS’s variables
Hadwiger's conjecture, first formulated in 1943, is a vast generalization of the four-color theorem, and remains one of the central open problems in
In the first paper of the Graph Minors series [JCTB ’83], Robertson and Seymour proved the Forest Minor theorem: the H-minor-free graphs have bounded
Sébastien Bouchard Title: Universal Exploration Sequences and Undirected s-t Connectivity (continued) Abstract: Undirected s-t connectivity (USTCON)