17 May 2018

Séminaire CANA: Classical and Quantum Simulations via Quantum algorithms, Pedro Costa

Abstract: The era of quantum computers has already started. One important question that we can do now that we have these quantum devices ready is which quantum model of computation will be a good choice for encoding the huge number of quantum algorithms available. Another important question which is also extremely important to people that work in the industry that very often employs numerical methods to solve differential equations is that if these numerical methods are a promising application for quantum computers. Going to these directions we will present in this seminar our latest results where we introduce a partitioned model of quantum cellular automata and show how it can simulate, with the same amount of resources, various models of quantum walks. All the algorithms developed within quantum walk models are thus directly inherited by the quantum cellular automata. The latter, however, has its structure based on local interactions between qubits, and as such it can be more suitable for present (and future) experimental implementations. In the part related with numerical methods to solve differential equations, we will present a quantum algorithm for simulating the wave equation under Dirichlet and Neumann boundary conditions. The algorithm uses Hamiltonian simulation and quantum linear system algorithms as subroutines. Relative to classical algorithms for simulating the D-dimensional wave equation, our quantum algorithm achieves exponential space savings, and a speedup which is polynomial for fixed D and exponential in D. We also consider using Hamiltonian simulation for Klein-Gordon equations and Maxwell’s equations.
17 May 2018, 14h0015h00
Salle des commissions, Bât TPR 2 - 1er étage (Luminy)

Prochains évènements

Retour à l'agenda
31 May 2018

Séminaire MOVE : Nash equilibria in games on graphs with a public signal monitoring, Patricia Bouyer-Decitre (LSV, ENS Paris-Saclay, CNRS)

In this talk, I will start by presenting all basic material about games on graphs, which will be useful. I will then focus on pure Nash equilibria in such games on graphs, with an imperfect monitoring based on a public signal. In such games, deviations and players responsible for those deviations can be hard to detect and track. I will present a generic epistemic game abstraction, which conveniently allows to represent the knowledge of the players about these deviations, and give a characterization of Nash equilibria in terms of winning strategies in the abstraction. I will then explain how that abstraction helps providing algorithms for computing Nash equilibria for some payoff functions.

04 Jun08 Jun 2018

WorkShop DYNI : DCLDE 2018

l'équipe DYNI du LIS, UTLN, est heureuse de lancer en partenariat avec le Scripps Inst. le plus grand challenge de bioacoustique sous-marine (4 To, Atlantique et Pacifique) dans le cadre du congrès de Détection Classification Localisation & Estimation de Densité de mammifère marin que nous co-organisons avec Sorbonne Univ. en Juin.