Computer Science

LIG has been an active participant to the development of quantum computing in France. Different works about quantum process algebra, quantum algorithms, complexity bounds, and communication protocols have been developped.
Many results about graph states and the link between the combinatorial properties of a family  of quantum states and the possibility to be used for computation or cryptographic tasks have been obtained . Recently, work to characterize the multipartiteness of quantum states and how to use them to exhibit properties in games or protocols that cannot be reached using only classical ressources and randomness are being investigated. A second active topic is how to use contextual properties from quantum information theory to study a quantization of combinatorial game theory.

A lecture on quantum information is given in the  Cybersecurity program of the Mathematics and Computer Science Master of the UGA.

  • [1] P. Jorrand and M. Lalire toward a quantum process algebra Proceedings of the 1st conference on Computing frontiers 2004
  • [2]C. Durr, M. Heligman, P. Hoyer and M. Mhalla  Quantum query complexity of some graph problems SIAM Journal On Computing 35(6):1310--1328, 2006.
  • [3] M. Mhalla,  and S. Perdrix "Finding Optimal Flows Efficiently" ICALP (1) 2008: 857-868, 2008
  • [4] J. Javelle, M. Mhalla,  and S. Perdrix "New protocols and lower bounds for quantum secret sharing" TQC 2012
  • [5] Mehdi Mhalla, Mio Murao, Simon Perdrix, Masato Someya, Peter S. Turner "Which graph states are useful for quantum information processing ?" TQC 2011
  • [6]Peter Hoyer, Mehdi Mhalla, Simon Perdrix  "Contextuality in multipartie pseudo-telepathy graph games" arXiv:1609.09689
  • [7] Paul Dorbec , Mehdi Mhalla   Quantum Combinatorial Games. arXiv:1701.02193