I am a first year PhD student at the LIP laboratory, in the team MC2 of the ENS Lyon and under the direction of Omar Fawzi. During my PhD, I am working on algorithmical aspects of quantum information theory.
My main subjects are information theory and quantum computing. But I am also interested in various combinatorial problems such as combinatorial optimization and graph theory.
You can find my resume here.
During my licence and master, I had the chance to work with many researchers on various subjects.
- In June and July 2015, I worked 6 weeks with Alantha Newman on a combinatorial problem: the alternating stock size problem.
- From May to August 2016, I worked with Ken-ichi Kawarabayashi on convering dicycles of a given parity in a directed graph.
- From February to June 2017, I worked with Samuel Fiorini on two problems. The first one was to study the complexity of the hyperplan separation bound, a bound extensively used to lower bound the extension complexity of many well known polytopes. The second problem was to study the extension complexity of the correlation poytope as a function of the tree width of this graph.
In my spare time, I often create some convoluted recipes. I also like learning languages, climbing and hiking.