Recherche

We use quantum devices from IBMQ to perform digital quantum simulations of the Schwinger model. We work with a quantum link model description of the

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

We present deterministic suffix-reading automata (DSA), a new automaton model over finite words. Our motivation for this model comes from

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

Real-time Operating Systems (RTOSs) are widely used to design and develop embedded safety critical software applications. Such applications have to be

/Exposé /Talk/ The Freeze-Tag Problem, introduced in Arkin et al. (SODA'02) consists of waking up a swarm of /n/ robots, starting from a single active

In this presentation, I will focus on two classes of games showing quantum computational advantage: XOR nonlocal games and XOR* sequential games with

Title: Bounded Predicates in Description Logics with Counting Abstract: A distinguishing feature of Description Logics (DLs), aimed at dealing with

Alternating timed automata (ATA) are an extension of timed automata where the effect of each transition is described by a positive boolean combination

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