Orateur
Gabriele Taurasi
(Université de Bordeaux, Institut de Mathématiques de Bordeaux)
Description
Quantum error-correcting codes are essential for protecting fragile quantum information against noise and decoherence. In the last decades, many methods from diverse areas of mathematics were applied to construct codes with good parameters, most significantly, big effort has been done using topological methods. More recently, it has been discovered that constructions arising from combinatorics and graph theory are also noteworthy. Here, we focus on non-trivial constructions of quantum codes from the so-called Cayley graphs, using methods that come from the algebraic world. Notably, those codes exhibit promising algebraic properties.