CARTE Project-Team

Planned talks


  • Pseudotelepathy games with graph states, contextuality and multipartiteness width
    By: Mehdi Mhalla
    Date: mardi 25 octobre 2016 à 14h
    En: B011
    Abstract: Analyzing pseudotelepathy graph games, we propose a way to build contextuality scenarios exhibiting the quantum supremacy using graph states. We consider the combinatorial structures generating equivalent scenarios. We investigate which scenarios are more multipartite and show that there exists graphs generating scenarios with a linear multipartiteness width.







General Objectives


  • Computability and Complexity of continuous and new model of computations
  • Implicit computational complexity
  • Proof on adversary formal systems

Master Thesis Proposal

  • Please contact Emmanuel Jeandel or any other team member, to discuss about a subject.