Orateur
Prof.
Paul MEUNIER
(KU Leuven)
Description
Simple combinatorial objects like finite graphs can reveal hidden endemically quantum behaviors. In the same way that the symmetries of a graph are encoded in its automorphism group, its quantum symmetries are encoded in its quantum automorphism group. Surprisingly, the latter can be very different from the former, and a graph can have much more symmetries in the quantum world than it has in the classical world. In this talk, after introducing the topic, I will present some of these examples as well as recent computations of quantum automorphism groups for some classes of graphs.
