Research

Ordered by publication date, as of August 8th, 2022.

• Mathys Rennela, Sebastiaan Brand, Alfons Laarman, Vedran Dunjko.
  Hybrid divide-and-conquer approach for tree search algorithms.
  Submitted, 2022. [arXiv]
• Robin Kaarsgaard, Mathys Rennela.
  Join inverse rig categories for reversible functional programming, and beyond
  MFPS XXXVII, 2021. [proceedings]
• Mathys Rennela, Alfons Laarman, Vedran Dunjko.
  Hybrid divide-and-conquer approach for tree search algorithms.
  Draft, 2020. [arXiv]
• Romain Péchoux, Simon Perdrix, Mathys Rennela, Vladimir Zamdzhiev.
  Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory.
  FOSSACS 2020. [LNCS 12077]
• Mathys Rennela.
  Convexity and Order in Probabilistic Call-by-Name FPC.
  LMCS, 2020. [arXiv]
• Mathys Rennela and Sam Staton.
  Classical control, quantum circuits and linear logic
  in enriched category theory.
  LMCS, 2020. [arXiv]
• Mathys Rennela.
  The conception of truth in game semantics and linear logic.
  Accepted for presentation at IHPST (Paris), 2012.
  Augmented version translated in English, 2017. [preprint]
• Robin Kaarsgaard and Mathys Rennela.
  Categorical models of reversible computing.
  Submitted, 2017. [preprint]
• Mathys Rennela and Sam Staton.
  Classical control and quantum circuits in enriched category theory.
  Accepted for MFPS XXXIII, 2017. [pre-proceedings]
• Robert Furber, Mathys Rennela and Sam Staton.
  Infinite-dimensionality in quantum foundations:
  W*-algebras as presheaves over matrix algebras.
  Accepted for QPL’16, 2016. [journal] [preprint]
• Iordanis Kerenidis, Mathieu Laurière, François Le Gall and Mathys Rennela.
  Information cost of quantum communication protocols.
  Quantum Information and Computation, Vol.16 No.3-4, March 1, 2016. [journal]
• Mathys Rennela and Sam Staton.
  Complete positivity and natural representation of quantum computations.
  Accepted for MFPS XXXI, 2015. [journal]
• Iordanis Kerenidis, Mathieu Laurière, François Le Gall and Mathys Rennela.
  Privacy in Quantum Communication Complexity.
  Accepted for QIP’15 & TQC’15 (poster), 2015. [arXiv]
• Mathys Rennela.
  Towards a Quantum Domain Theory:
  Order-Enrichment and Fixpoints in W*-Algebras.
  Accepted for MFPS XXX, 2014. [journal]

THESES, SURVEYS, ETC…

• PhD thesis on Enrichment in Categorical Quantum Foundations.
  Under the joint supervision of Prof. Bart Jacobs and dr. Sam Staton.
  Obtained on January 9th, 2019 at Radboud University.
• Master thesis on Operator Algebras in Quantum Computation.
  Under the supervision of Bart Jacobs.
  In partial fulfillement of the MPRI master (Université Paris 7 Denis Diderot). 2013.
• Master thesis on The Fifth-Generation Computing project (french).
  Under the supervision of Annick Horiuchi.
  In partial fulfillment of the LOPHISS-SC2 master (Université Paris 7 Denis Diderot). 2012.
• Survey on Information Causality (french).
  Under the supervision of Iordanis Kerenidis. 2012.

Advertisement