Concept
Aix-en-Provence
Related courses (32)
PHYS-739: Conformal Field theory and Gravity
This course is an introduction to holography, the modern approach to quantum gravity.
MATH-510: Algebraic geometry II - schemes and sheaves
The aim of this course is to learn the basics of the modern scheme theoretic language of algebraic geometry.
PHYS-202: Analytical mechanics (for SPH)
Présentation des méthodes de la mécanique analytique (équations de Lagrange et de Hamilton) et introduction aux notions de modes normaux et de stabilité.
PHYS-702: Advanced Quantum Field Theory
The course builds on the course QFT1 and QFT2 and develops in parallel to the course on Gauge Theories and the SM.
CS-308: Introduction to quantum computation
The course introduces the paradigm of quantum computation in an axiomatic way. We introduce the notion of quantum bit, gates, circuits and we treat the most important quantum algorithms. We also touch
ChE-403: Heterogeneous reaction engineering
The theoretical background and practical aspects of heterogeneous reactions including the basic knowledge of heterogeneous catalysis are introduced. The fundamentals are given to allow the design of m
PHYS-100: Advanced physics I (mechanics)
La Physique Générale I (avancée) couvre la mécanique du point et du solide indéformable. Apprendre la mécanique, c'est apprendre à mettre sous forme mathématique un phénomène physique, en modélisant l
CS-523: Advanced topics on privacy enhancing technologies
This advanced course will provide students with the knowledge to tackle the design of privacy-preserving ICT systems. Students will learn about existing technologies to prect privacy, and how to evalu
PHYS-758: Advanced Course on Quantum Communication
The aim of this doctoral course by Nicolas Sangouard is to lay the theoretical groundwork that is needed for students to understand how to take advantage of quantum effects for communication technolog
MATH-467: Probabilistic methods in combinatorics
The 'probabilistic method' is a fundamental tool in combinatorics. The basic idea is as follows: to prove that an object (for example, graph) with certain properties exists, it suffices to prove that