Marc Kaplan

Quantum computer scientist

I am a research associate at university of Edinburgh. Prior to that, I was a the recipient of the ANR retour des post-docs fellowship, during three years that I have spent in the quantum information group at the INFRES Departement of LTCI (CNRS, Telecom ParisTech).
Between 2009 and 2011, I was a post-doc at the University of Montréal, hosted by Gilles Brassard. I finished a doctorat (equivalent to Ph.D) under the direction of Sophie Laplante, in the Algorithmique et complexité group of the laboratoire de recherche en informatique de l'université Paris Sud 11.

Here is a list of my research directions:

  • Quantum and post-quantum cryptography: using the tools from quantum algorithms and complexity theory to analyse quantum and classical cryptography.
  • Foundations of quantum informations: looking at those from the information theoretic point of view. This approach informs us about the foundations, but in turn, helps us understand better the tools we are using.
  • Communication complexity: proving lower bounds and applying the techniques to other domains, especially quantum foundations
Me, by Christoph Dürr (Click to change)

A list of publications

  • Provably secure key establishment against quantum adversaries (quant-ph)
    Alexandrs Belovs, Gilles Brassard, Peter Høyer, Marc Kaplan, Sophie Laplante, and Louis Salvail
    the 12th Conference on Theory of Quantum Computation, Communication and Cryptography (Tqc’17)
  • Breaking Symmetric Cryptosystems using Quantum Period Finding (quant-ph)
    Marc Kaplan, Gaëtan Leurent, Anthony Leverrier, Marìa Naya-Plasencia
    Proc. of the 36st Annual Cryptology Conference (CRYPTO 2016), Part II, p.207-237
  • Quantum Differential and Linear Cryptanalysis (quant-ph)
    Marc Kaplan, Gaëtan Leurent, Anthony Leverrier, Marìa Naya-Plasencia
    To appear at Transactions on Symmetric Cryptology
  • Quantum attacks against iterated block ciphers (quant-ph)
    Marc Kaplan
    Presented at the 4th Workshop on Current Trends in Cryptology
  • Violating multipartite Bell inequalities without reference frames (quant-ph)
    Celal Furkan Senel, Thomas Lawson, Marc Kaplan, Damian Markham, Eleni Diamanti
    Phys. Rev. A 91, 052118 (2015)
  • Fine-grained EPR-steering inequalities (quant-ph)
    Tanumoy Pramanik, Marc Kaplan, Archan S Majumdar
    Phys. Rev. A 90, 050305(R) (2014)
  • Dimension of physical systems, information processing, and thermodynamics (quant-ph)
    Nicolas Brunner, Marc Kaplan, Anthony Leverrier, Paul Skrzypczyk
    New J. Phys. 16 123050, 2014
  • Simulating equatorial measurements on GHZ states with finite expected communication cost (quant-ph)
    Gilles Brassard, Marc Kaplan
    Proc. of the 7th conference on Theory of Quantum Computation, Communication, and Cryptography, p. 65-73
  • Merkle puzzles in a quantum world (quant-ph)
    Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail
    Proc. of the 31st International Cryptology Conference (CRYPTO 2011), p. 391-410
  • Non-local box complexity and secure function evaluation (quant-ph)
    Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jeremie Roland
    Quantum Information and Computation, Vol. 11(1-2), p. 40-69 (2011)
    Previously published in:
    Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009), p. 239-250
  • The communication complexity of non-signaling distributions (quant-ph)
    Julien Degorre, Marc Kaplan, Sophie Laplante, Jeremie Roland
    Quantum Information & Computation, Vol. 11(7-8), p. 649-676 (2011)
    Previously published in:
    Proceedings of the 34st International Symposium on Mathematical Foundations of Computer Science (MFCS 2009), p. 270-281.
  • Kolmogorov complexity and combinatorial methods in communication complexity (ECCC)
    Marc Kaplan, Sophie Laplante
    Theoretical Computer Science special issue for TAMC'09 412(23), p. 2524-2535 (2011)
    Previously published in:
    Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (TAMC 2009), p. 261-270.

PhD Thesis (in french)

  • Méthodes combinatoires et algebriques en complexité de la communication
    Available here: TEL
I have been involved in the following courses:
  • Ecole Polytechnique: Modal Web (2x36h)
  • Université de Caen: Introduction à l’information quantique - M1 (2h)
2008 - 2009
  • Université Paris 11: TD d'algorithmique et complexité - L3 (33h)
  • Université Paris 11: TD et TP de systèmes d'exploitation - L3 (33h)
  • IFIPS: TD et TP de système - 1ère année, filière apprentissage (18h)
  • IFIPS: suivi de stage en entreprise - 3ème année
2007 - 2008
  • Ecole Polytechnique : TD de bases de la programmation et de l'algorithmique - 1ère année (40h)
2006 - 2007
  • Ecole Polytechnique : TD de bases de la programmation et de l'algorithmique - 1ère année (20h)
  • Université Paris 11 : TD et TP d'introduction à l'informatique - Licence 1ère année (35h)
A random thing I like (click to see another)