Quantum Computer Scientist

I am a CNRS researcher at LORIA, MOCQUA team. My research area is Quantum Computing and related topics. [ see bio for details ]

• • (New) 2 papers at LiCS’18: A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics and Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics
  • (New) ERCIM special issue on quantum computing is available: https://ercim-news.ercim.eu/

Some contributions (here is a list of publications)

• A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics (with Emmanuel Jeandel and Renaud Vilmart), LiCS’18.
• Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics (with Emmanuel Jeandel and Renaud Vilmart), LiCS’18.
• A complete characterisation of All-versus-Nothing arguments for stabiliser states (with Samson Abramsky, Rui Soares Barbosa, Giovanni Carù) Phil. Trans. A Royal Society A 375: 20160385..
• Towards a Minimal Stabilizer ZX-calculus (with Miriam Backens and Harny (Quanlong) Wang) preprint.
• Determinism and Computational Power of Real Measurement-based Quantum Computation (with Luc Sanselme) FCT’17
• Contextuality in multipartie pseudo-telepathy graph games (with Anurag Anshu, Peter Hoyer and Mehdi Mhalla) FCT’17
• ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T quantum mechanics (with Emmanuel Jeandel, Renaud Vilmart and Harny Wang) MFCS’17
• A complete characterisation of All-versus-Nothing arguments for stabiliser states (with Samson Abramsky, Rui Soares Barbosa, Giovanni Carù) QPL’17.
• Y-Calculus: A language for real Matrices derived from the ZX-Calculus (with Emmanuel Jeandel and Renaud Vilmart) QPL’17
• Supplementarity is Necessary for Quantum Diagram Reasoning (with Harny (Quanlong) Wang) MFCS’16
• A Simplified Stabilizer ZX-calculus (with Miriam Backens and Harny (Quanlong) Wang) QPL’16
• Reversible causal graph dynamics (with Pablo Arrighi, Simon Martiel) RC’16
  
• On Weak Odd Domination and Graph-based Quantum Secret Sharing (with Sylvain Gravier, Jérôme Javelle, and Mehdi Mhalla) Theor. Comput. Sci. 598: 129-137 (2015)
• Minimum Degree up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms (with David Cattaneo) ISAAC’15
  
• Block Representation of Reversible Causal Graph Dynamics (with Pablo Arrighi and Simon Martiel) FCT’15
  
• Reversibility in the Extended Measurement-based Quantum Computation (with Nidhal Hamrit) RC’15
  
• Quantum Circuits for the Unitary Permutation Problem (with Stefano Facchini) TAMC’15
  
• Call-by-value, call-by-name and the vectorial behaviour of the algebraic lambda-calculus (with Ali Assaf, Alejandro Díaz-Caro, Christine Tasson, and Benoît Valiron) LMCS, vol. 10, issue 4
  
• The Parameterized Complexity of Domination-type Problems and Application to Linear Codes (with David Cattaneo) TAMC’14
  
• Pivoting makes the zx-calculus complete for real stabilizers (with Ross Duncan), QPL’13
  
• Parameterized Complexity of Weak Odd Domination Problems (with David Cattaneo), FCT’13
  
• Access structure in a graph in higher dimension and applications to secret sharing protocols (with Anne Marin and Damian Markham), TQC’13
  
• Quantum Secret Sharing with Graph States (with Sylvain Gravier, Jérôme Javelle, and Mehdi Mhalla), MEMICS’12
  
• Graph States, Pivot Minor, and Universality of (X,Z)-measurements (with Mehdi Mhalla), International Journal of Unconventional Computing
  
• On the Minimum Degree up to Local Complementation: Bounds and Complexity (with Jérôme Javelle and Mehdi Mhalla), WG’12
  
• New Protocols and Lower Bound for Quantum Secret Sharing with Graph States (with Jérôme Javelle and Mehdi Mhalla), TQC’12
  
• Optimal accessing and non-accessing structures for graph protocols (with Sylvain Gravier, Jérôme Javelle, and Mehdi Mhalla)
• Classical versus Quantum Graph-based Secret Sharing (with Jérôme Javelle and Mehdi Mhalla)
• Completeness of algebraic CPS simulations (with Ali Assaf), DCM’11
  
• Which graph states are useful for quantum information processing? (with Mehdi Mhalla, Mio Murao, Masato Someya, Peter Turner), TQC’11
  
• Structural characterization of graph states for quantum information processing (with Mehdi Mhalla, Mio Murao, Masato Someya, Peter Turner), poster at QIP’2011
  
• Rewriting measurement-based quantum computations with generalised flow (with Ross Duncan), ICALP’10
  
• Environment and classical channels in categorical quantum mechanics (with Bob Coecke), CSL’10
  
• Equivalence of algebraic lambda-calculi (with Alejandro Diaz-Caro, Christine Tasson and Benoît Valiron), HOR’10
  
• Computational depth complexity of measurement-based quantum computation (with Dan Browne and Elham Kashefi), TQC’10

Grants

• ANR SoftQPro (ANR PRCE) PI [2017-2021]
• ANR-NRF VanQuTe (ANR PRCI-France/Singapore) [2018-2022]
• PIA-GDN QuantEx (with Atos-Bull, CEA, LRI) [2017-2020]
• ECOS PA17C03 « QuCa » (with U. Quilmes, Inria, LIF, LRI) [2018-2019]
• JCQ Jeux combinatoires quantiques (CNRS PEPS) [2016]
• STIC-AmSud project FoQCoSS: Foundations of Quantum Computation: Syntax and Semantics [2016-2017]
• Univ. Lorraine – Région Lorraine project Calcul quantique par mesure, PI [2014-2015]
• CCQD Cryptographie et Calcul Quantiques Distribués (CNRS PEPS ICQ) [2013]
• GraphIQ (CNRS-INS2I PEPS, PI) [2010-2011]
• QuAND (CNRS-INS2I PEPS) [2010-2011]
• CausaQ (ANR Jeune Chercheur) [2010-2015]

Program committees

• QI’18 Quantum Interaction 2018 conference, Nice Sophia Antipolis, France.
• MCU’18 8th Conference on Machines, Computations and Universality, 2018, Fontainebleau, France.
• QPL’18 15th International Conference on Quantum Physics and Logic, 2018, Halifax, Canada.
• DCM’18 12th International Workshop on Developments in Computational Models, FLoC 2018, Oxford, UK.
• IQFA’17 8th IQFA’s Colloquium, 2017, Nice, France.
• QPL’17 14th International Conference on Quantum Physics and Logic, 2017, Nijmegen, the Netherlands.
• IQFA’16 7th IQFA’s Colloquium, 2016, Telecom ParisTech, Paris, France.
• QPL’16 13th International Conference on Quantum Physics and Logic, 2016, Glasgow, Scotland.
• AQIS’15 15th Asian Quantum Information Science Conference, August 24-28, 2015 in Seoul, Korea.
• QPL’15 12th International Workshop on Quantum Physics and Logic, 2015, Oxford, UK.
• IQFA’15 6th IQFA’s Colloquium, 2016, Telecom ParisTech, Paris.
• STACS’14 Symposium on Theoretical Aspects of Computer Science, Lyon.
• QPL’14 11th International Workshop on Quantum Physics and Logic, June 4-6, 2014, Kyoto, Japan.
• ParQ’13 1st Workshop on Parallel Quantum Computing, Sept. 2013, Edinburgh.
• QPL’13 10th International Workshop on Quantum Physics and Logic, 17-19 July 2013, Barcelona, Spain.
• AQIS’13 13th Asian Quantum Information Science Conference, August 25-30, 2013 in Chennai, India.
• QPL’12 9th workshop on Quantum Physics and Logic, 10-12 October 2012, Brussels, Belgium.
• FounQI’12 Foundational principles in Quantum Information, workshop associated to UCNC 2012, 7-8 Sept. 2012.
• AQIS’12 12th Asian Quantum Information Science Conference, August 23-28, 2012 in Suzhou, China.
• Quantitative approaches @ LI’2012, February 20-24 2012, Marseille, France.
• LI’2012 Logic and interactions 2012, 30 January to 2 March 2012, Marseille, France.
• QPL’11 8th workshop on Quantum Physics and Logic, 27-29 October 2011, Nijmegen, the Netherlands.
• MEMICS’11 7th Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, 14-16 October 2011, Lednice, Czech Republic.
• DCM’10 Developments in Computational Models, Causality, Computations, and Physics, FLoC workshop, 09-10 July 2010, Edinburgh.
• QPL’10 7th workshop on Quantum Physics and Logic, 29-30 May 2010, Oxford.
• DCM’09 Developments in Computational Models, Computational Models From Nature, ICALP workshop, 11 July 2009, Rhodes, Greece.
• CEQIP’09 6th Central European Quantum Information Processing Workshop 1-4 June 2009, Jindřichuv Hradec, Czech Republic

Teaching