Web page of the Quantum group


Groups
  Algorithms and Complexity

Joint Inria project teams


Research highlights


Contracts & grants
  ALGOQP
  QAP
  QCCC
  HSP
  QRAC
  CSQIP
  Cryptanalyse Quantique
  GT IQ
  JST-ICT
  Réseaux quantiques
  RESQ
  CRYQ

Software & patents


Collaborations
  GDR ICQ
  Quantum algorithms and complexity theory

Members
  LAPLANTE Sophie
  MAGNIEZ Frédéric
  SANTHA Miklos
  SANSELME Luc
  KERENIDIS Iordanis
  KAPLAN Marc
  CHAILLOUX André
  MAGNIN Loïck
  RICHTER Peter
  KEMPE Julia

Ph.D. dissertations & Faculty habilitations
  Approximate Verification - Quantum Computing
  Quantum Encodings and Applications to Locally Decodable Codes and Communication Complexity
  Self-Testing for Approximate and Qantum Computing

° Algorithm control and hyper-parameter tuning
° Algorithms for networked systems
° Automated Proof, SMT and Applications
° Automated Reasoning
° Combinatorics
° Compilation and code optimization
° Data-Centric Languages and Systems
° Deductive Verification of Programs
° Digital Fabrication
° Distributed algorithms
° Distributed Design
° Engineering of interactive systems
° Fab lab
° Formal Model-Based Testing
° Formalisation and Proof of Numerical Programs
° Formalisation of (Specification and Programming) Languages in Proof Assistants
° Generative design methods
° Graph Theory
° Green networks
° Heterogeneous Wireless Networks
° High-performance computing
° Human-Computer Interaction
° Integration of Data and Knowledge
° Interaction and visualization paradigms
° Large scale modelling