2023Activity reportProject-TeamMOCQUA

7.1.1 FiatLux

• Keywords:
  Cellular automaton, Multi-agent, Distributed systems, Numerical simulations
• Scientific Description:
  FiatLux is a discrete dynamical systems simulator that allows the user to experiment with various models and to perturb them. It includes 1D and 2D cellular automata, moving agents, interacting particle systems, etc. Its main feature is to allow users to change the type of updating, for example from a deterministic parallel updating to an asynchronous random updating. FiatLux has a Graphical User Interface and can also be launched in a batch mode for the experiments that require statistics.
• Functional Description:
  FiatLux is a cellular automata simulator in Java specially designed for the study of the robustness of the models. Its main distinctive features are to allow users to perturb the updating of the system (synchrony rate) and the topology of the grid.
• URL:
  https://­project.­inria.­fr/­fiatlux/
• Contact:
  Nazim Fates
• Participant:
  Nazim Fates
• Partners:
  ENS Lyon, Université de Lorraine

8.1.1 Quantum programming languages

Quantum programming languages are essential for developing new algorithms and actually using the quantum computer. We have two contributions described in this section, based on the introduction of two languages: Qimaera dedicated to some particular classes of quantum algorithms, including variational quantum algorithms, a particular promising family of quantum algorithms for short terms applications; The second contribution is the FOQ language which, in the implicit complexity framework, captures quantum polynomial time, so roughly speaking a FOQ program is guaranteed by construction to run in polynomial time on a quantum computer.

Variational quantum programming in Idris. Variational Quantum Algorithms 58, 55, 49 are hybrid classical-quantum algorithms where classical and quantum computation work in tandem to solve computational problems. These algorithms create interesting challenges for the design of suitable programming languages, because they have to be able to accommodate both classical and quantum programming primitives simultaneously.

As part of this research project, we develop a set of libraries for the Idris 2 programming language that enable the programmer to implement (variational) quantum algorithms where the full power of the elegant Idris language works in synchrony with quantum programming primitives that we introduce. The two key ingredients of Idris that make this possible are (1) dependent types which allow us to implement unitary (i.e. reversible and controllable) quantum operations; and (2) linearity which allows us to enforce fine-grained control over the execution of quantum operations that ensures compliance with the laws of quantum mechanics. We demonstrate that our libraries, named Qimaera, are suitable for variational quantum programming by providing implementations of the two most prominent variational quantum algorithms – QAOA 49 and VQE 58. To the best of our knowledge, this is the first implementation of these algorithms that has been achieved in a type-safe framework.

The results of this work were presented in 2023 in the conference ESOP 19. The software is open-source, available under the MIT license here. These results were obtained during the (bachelor) internship of Liliane-Joy Dandy in our team and she was awarded the "Research Internship Prize" at École Polytechnique for her work.

Characterization of quantum polynomial time. In 23, we introduce a First-Order Quantum programming language, hence named FOQ, whose terminating programs are reversible. We restrict FOQ to a strict and tractable subset – called PFOQ for polynomial FOQ – of terminating programs with bounded width, that provides a first programming language-based characterization of the quantum complexity class FBQP. FBQP is the functional extension of the class BQP known as Bounded-error Quantum Polynomial time, the class of decision problems that can be solved by a polynomial time quantum Turing machine with probability greater than $2/3$. We finally present a tractable semantics-preserving algorithm compiling a PFOQ program to a quantum circuit of size polynomial in the number of input qubits.

8.1.2 Quantum Circuits

The quantum circuit model is the most standard model of quantum computing. Quantum circuits are ubiquitous in quantum computing, serving as both a low-level language and, surprisingly, a higher-level language used to describe certain quantum algorithms. We have introduced the first complete equational theory for quantum circuits, for reasoning on quantum circuits; we have also introduced new techniques for quantum circuit optimisation.

Completeness for Quantum Circuits. With the current advances in quantum technologies and quantum software, it is essential to develop formalisms for transforming and reasoning about quantum circuits. This is crucial for optimizing their size or depth, adapting code to architectural constraints, making it fault-tolerant, or verifying the equivalence of two circuits.

To achieve these goals, quantum circuits can be equipped with equational theories that enable the transformation of circuits using rules that are preferably simple and intuitive. These rules allow the replacement of a circuit fragment with an equivalent circuit. An equational theory is considered complete when, for any pair of circuits representing the same quantum evolution, there is a way to transform one into the other using only the rules of the equational theory.

We have introduced the first complete equational theory for quantum circuits 18, a problem which was open for more than 30 years. Indeed the only fragments equipped with a complete equational theory before, were non-universal and efficiently classically simulatable 59, 43, 44, 53. This result has been presented at LICS'23. We have obtained the completeness for quantum circuits through a non-trivial completion procedure based on the LOv-calculus 47 for which we have introduced a complete equational theory recently. This result has been obtained in collaboration with the Quacs Inria team in Saclay and the start-up Quandela.

This year, we have also simplified and generalised this equational theory to quantum circuits involving ancillary qubits and quantum measurements 17. This result will be presented at CSL'24. Finally, we have recently a minimal equational theory for vanilla quantum circuits (i.e. the standard model of quantum circuits without ancillary qubits) that we have proved to be minimal, i.e. each rule is necessary for the completeness 36. One of the main and original contributions of this paper is demonstrating that the use of a rule acting on an unbounded number of qubits is necessary for completeness.

Hadamard count minimization in Clifford+T circuits. We have introduced an algorithm which essentially optimally minimizes the number of Hadamard in a Clifford+T circuit. When compiling quantum circuit with the gate set Clifford+T, one usually tries to minimize the number of T gates. This is because T gates are usually more costly to implement fault-tolerantly. This minimization problem when there are no Hadamard gates in the circuit is well understood. To handle the general case one can optimize around Hadamard gates or use some gadgetisation techniques. In both cases minimizing the number of Hadamard gate in the circuit beforehand can also help reducing the number of T gates overall.

This work has been done in collaboration with Simon Martiel (Atos), and has been accepted in the ACM journal Transactions on Quantum Computing 40 and has been presented at the prestigious conference TQC'23 24.

8.1.3 Quantum error correcting codes and fault-tolerance

Quantum error correcting codes are crucial in the quest of a fault-tolerant large-scale quantum computer. We have contributed to the development of surface codes, we have also introduced a new family of quantum codes, the quantum rotor codes, finally and may be more surprisingly, we have shown that minimalist error correcting codes can be used in near-term experiments for demonstrating a separation between classical and quantum computers.

Fault-tolerant Clifford gates on toric codes. Quantum error correcting codes with good encoding rates promise to reduce the cost of fault-tolerant quantum computation by reducing the number of physical qubits needed for a target level of protection and number of logical qubits needed. The savings come at the price of more complex procedures for the implementation of gates on logical qubits within the code. One technique for homological codes from 2D manifold is to apply a Dehn twist to a handle of the surface which implements a CNOT gate between the logical qubits of the handle. Alexandre Guernut for his PhD studied the generalization of Dehn-twists to other 2D codes, namely color codes. We discovered that in practice for small system size the color code Dehn twists were spreading too much the noise. Therefore we switched gears by unfolding the color code to two copies of the toric code and set out to design and evaluate the performance of a generating set of the Clifford group on toric codes that would have a constant-depth implementation. The numerical results are now promising and a paper is in preparation.

Quantum rotor codes. The work 41 is a collaboration in progress with Barbara Terhal (Delft University) and Allessandro Ciani (Forschungszentrum Jülich). Quantum systems in real laboratories do not always consist in a set of qubits but often systems with a richer structure for their Hilbert space. For instance they are often infinite dimensional, as are quantum oscillators or quantum rotors. Exploiting the structure and knowledge of the full physical system when designing quantum error correcting codes is a promising way of reducing the overhead of error correction. Quantum error correction with quantum oscillators has been well studied either for encoding qubits within quantum oscillators (the field of bosonic codes) or encoding oscillators in several oscillators for which several no-gos have been proven. Quantum rotors can be thought as intermediate systems between qubits (finite) and quantum oscillators (infinite and continuous). We are studying quantum error correcting codes for quantum rotors both encoding finite or infinite logical information. The codes we defined encoding finite systems have some similarity with so-called protected superconducting qubits such as the 0-$\pi$ qubit. Moreover our construction generalizes to more protected qubits potentially realizable in superconducting circuits. This was submitted and accepted for publication in Communication in Mathematical Physics.

Robust Sparse IQP Sampling in Constant depth. In collaboration with the Inria teams Quantic and Cosmiq we studied the problem of making the sparse instantaneous quantum polynomial-time (IQP) sampling problem robust to noise and constant depth, therefore making it more accessible to near-term experiments 26. Sparse IQP sampling problems are problems that are demonstrably hard to sample from with a classical computer but straightforward for a quantum computer and hence candidates for demonstration of quantum advantage. The problem is that convincing advantage needs to be able to scale up the quantum circuit which cannot be done in the presence of noise. This work shows how to use the minimal amount of quantum error correction necessary to be able to scale while correcting errors. This work has been accepted for a plenary talk at the QIP2024 conference.

8.1.4 Graph states and Measurement-based quantum computing

There are various models of quantum computation. Whereas unitary evolutions are at the heart of the standard model of quantum computing, measurement-based quantum computing (MBQC) is an alternative model introduced more than 20 years ago, which consists in performing quantum measurements over a large entangled initial resource called a graph state. We have contributed to the development of MBQC and also to a recent graph-state-based protocol called $k$-parability which is a primitive for distributed quantum computing.

Measurement-based quantum computing on qudit-graph states. In measurement-based quantum computing (MBQC), computation is carried out by a sequence of measurements and corrections on an entangled state. Flow, and related concepts that we have contributed to develop in the past decades 56, 57, are powerful techniques for characterising the dependence of the corrections on previous measurement outcomes. We have introduced flow-based methods for MBQC with qudit graph states when the local dimension of the entangled state is an odd prime. Our main results are a proof that such flow is a necessary and sufficient condition for a strong form of determinism. This work has been done in collaboration with Aleks Kissinger (Oxford), Damian Markham (LIP6), Clément Meignant (LIP6) and Robert Booth who did a joint PhD in the Mocqua team and LIP6 and who is now postdoc in Edinburgh. This paper has been publish in Journal of Physics A: Mathematical and Theoretical 13.

Small pairable states. A $k$-pairable $n$-qubit state is a resource state that allows Local Operations and Classical Communication (LOCC) protocols to generate pairs of maximally entangled 2-qubit states among any $k$-disjoint pairs of the $n$ qubits. The best known resource states, introduced by Bravyi et al. 45, had a number of qubits growing exponentially with the parameter $k$. We have shown the existence of `small' pairable quantum states with a number $n$ of qubits polynomial in $k$. We have also established bounds on the pairability, relating this quantity to other graph parameters, in particular the local minimal degree. We have also extended the notion of pairability to vertex minor universality, a natural graph property. This work has been done in collaboration with Mehdi Mhalla (LIG, Grenoble) 35. We are currently working in collaboration with Stéphan Thomassé (LIP, ENS Lyon), Valentin Savin and Maxime Cautrès (CEA Grenoble) on the extensions of these results.

8.2.1 Producing a point in a set

We have studied the solvability of the following problem: given a set in a fixed space, produce a point in that set. This problem was studied in 46 for various spaces. It was proved that for a restricted class of spaces, this problem is solvable precisely when the space is in some sense complete. We have shown that this characterization fails for general spaces but holds under a natural modification of the problem, by allowing more sets as inputs. The results are published in 16.

8.2.2 Algorithmic properties of sets

We investigated the relationship between the computability of sets and their topological properties. More precisely, we are studying which sets have “computable type”, which is the property that any algorithm that semidecides the set can be converted into an algorithm that fully decides the set. We have shown that this property is equivalent to the fact that the set satisfies an invariant of low complexity, and such that no proper subset satisfies this invariant. For instance, the circle is minimal satisfying the invariant “having a hole”. This result unifies many previous results, implies new results and opens up a new research direction: finding invariants of low complexity. The result is published in 11.

In the study of computable type, one also wants to show that a set does not have computable type, by producing a copy of the set which is semicomputable but not computable. This task can be difficult, especially if the set is not expliticly given but is defined in an implicit way. We have obtained a very general result which characterizes when two notions of computability are not equivalent, using topological arguments. This gives a much simpler way of separating two computability notions, reducing it to a comparison between two topologies. The result is published in 10.

To a topological space is associated the problem of producing a presentation of this space. We have investigated the possible degrees of difficulty of this problem. This study requires the understanding of the algorithmic complexity of detecting various topological invariants, notably the ones coming from homology and which count the holes in the space. The results are published in 15.

8.2.3 Noninterference policies for polynomial time

In 22, we introduce a new noninterference policy to capture the class of functions computable in polynomial time on an object-oriented programming language. This policy makes a clear separation between the standard noninterference techniques for the control flow and the layering properties required to ensure that each "security" level preserves polynomial time soundness, and is thus very powerful as for the class of programs it can capture. This new characterization is a proper extension of existing tractable characterizations of polynomial time based on safe recursion. Despite the fact that this noninterference policy is ${\Pi }_1^0$-complete, we show that it can be instantiated to some decidable and conservative instance using shape analysis techniques.

8.3.1 Probabilistic cellular automata for problem solving

The decentralised diagnosis problem consists in the detection of a certain amount of defects in a distributed network. We continued our work with Régine Marchand (IECL, Université de Lorraine) and Irène Marcovici (now at Université de Rouen) 20. We tackled this problem in the context of two-dimensional cellular automata with three states: given a threshold of defects to detect, we want the alert state to coexist with the neutral state when this density is above the threshold, we want the alert state to invade the whole grid. We presented two probabilistic rules to solve this problem. The first one is isotropic and is studied with numerical simulations. The second one is defined on Toom's neighbourhood and is examined with an analytical point of view. These solutions constitute a first step towards a broader study of the decentralised diagnosis problem on more general networks.

8.3.2 Enumerative or bijective combinatorics

Baxter Tree-like tableaux. The article 12 is the result of a collaboration of M. Bouvel started at LaBRI in 2012 (when she was there), with J.-C. Aval, A. Boussicault, O. Guibert and M. Silimbani. It has been completed and submitted in 2021, but has then been largely revised and published in 2023.

Tree-like tableaux are objects in bijection with alternative or permutation tableaux, which are classical objects in combinatorics. Our work defines and studies a new subclass of tree-like tableaux enumerated by the famous Baxter numbers. We exhibit simple bijective links between these objects and three other combinatorial classes: (packed or mosaic) floorplans, twisted Baxter permutations and triples of non-intersecting lattice paths. From several (and unrelated) works, these last objects are already known to be enumerated by Baxter numbers, and our main contribution is to provide a unifying approach to bijections between Baxter objects, where Baxter tree-like tableaux play the key role.

Enumeration of pattern-avoiding inversion sequences. The results presented here have been obtained by Benjamin Testart during the first year of his PhD thesis. They are concerned with inversion sequences, which are integer sequences $({\sigma }_1,\cdots ,{\sigma }_n)$ such that $0\le {\sigma }_i<i$ for all $1\le i\le n$. The study of pattern-avoiding inversion sequences began in two independent articles  54, 48, which solved the enumeration of inversion sequences avoiding a single pattern for every pattern of length 3 except the patterns 010 and 100. The case 100 was recently solved by Mansour and Yildirim.

In his 2022 preprint, Benjamin solves the final case by making use of a decomposition of inversion sequences avoiding the pattern 010 according to original parameters. The method is then expanded to solve the enumeration of inversion sequences avoiding several pairs of patterns containing 010, most of the time solving also the enumeration of some family of constrained words as an auxiliary problem.

In a paper that is currently being written, Benjamin in addition managed to obtain all missing enumerations for inversion sequences avoiding a pair of patterns of size 3 (17 such families in total). To achieve this, Benjamin has used in a clever way the (established) method of generating trees in a few cases, and has otherwise used several decompositions of inversion sequences that he introduced. This work will be submitted soon to a good journal in combinatorics.

8.3.3 Probabilistic or geometric combinatorics

Convergence law for 231-avoiding permutations. In earlier work with Michael Albert (University of Otago) and Valentin Féray (IECL, Université de Lorraine), we compared the expressibility of two logics on permutations, called TOOB (theory of one bijection, seeing permutations as a bijection) and TOTO (theory of two orders, seeing permutations as a pair of total orders). In the paper 9 (recently accepted for publication in DMTCS, in the special issue following the conference Permutation Patterns 2023), we focus on TOTO, and study a different problem. Namely, we investigate the existence of 0/1 or convergence laws when the domain is restricted to families of permutations avoiding patterns, similarly to a classical approach in the study of graphs.

Specifically, we prove that the class of 231-avoiding permutations satisfies a convergence law (but not a 0/1 law). In other words, for any first-order sentence $\psi$ in the language TOTO of two total orders, the probability $p_n\left(\psi \right)$ that a uniform random 231-avoiding permutation of size $n$ satisfies $\psi$ admits a limit as $n$ is large. Moreover, we establish two further results about the behaviour and value of $p_n\left(\psi \right)$: (i) it is either bounded away from 0, or decays exponentially fast; (ii) the set of possible limits is dense in $[0,1]$. Our tools come mainly from analytic combinatorics and singularity analysis. We hint at possible generalisations to other families of pattern-avoiding permutaitons.

Scaling limits of families of intersection graphs. This is the latest result of a collaboration of M. Bouvel with Frédérique Bassino (LIPN, Université Paris Nord), Valentin Féray (IECL, Université de Lorraine), Lucas Gerin (CMAP, École Polytechnique) and Adeline Pierrot (LISN, Université Paris-Sud) which started over ten years ago. The purpose of this collaboration is to establish limit shape results for combinatorial structures (like permutations or graphs) constrained by the avoidance of substructures, often using methods from analytic combinatorics (which is original in the landscape of the research on this topic).

In an almost finished paper, we obtain the scaling limits of random graphs drawn uniformly in three families of intersection graphs: permutation graphs, circle graphs, and unit interval graphs. The two first families typically generate dense graphs (with a quadratic number of edges), and in these cases we prove almost sure convergence to an explicit deterministic graphon. Uniform unit interval graphs are nondense and we prove convergence in the sense of Gromov–Prokhorov after normalization of the distances.

Decomposition of order types, with applications to counting problems. This topic, at the interface of combinatorics and discrete geometry, has emerged as the result of a collaboration between several teams in Nancy, and involves M. Bouvel, V. Feray (IECL, Université de Lorraine), X. Goaoc (Gamble) and F. Koechlin (post-doc with X. Goaoc until September 2023). In this undergoing work, we introduce and study an original notion of decomposition of planar point sets (or rather of their chirotopes, also called order types) as trees decorated by smaller chirotopes. This decomposition is based on the concept of mutually avoiding sets, and adapts in some sense the modular decomposition of graphs (or its cousin the substitution decomposition of permutations) in the world of chirotopes. We prove that the associated tree always exists and is unique up to some appropriate constraints. We also show how to compute the number of triangulations of a chirotope efficiently, starting from its tree and the (weighted) numbers of triangulations of its parts.

8.3.4 Analysis of graphs in the field of economics

In collaboration with Massimo Amato and Lucio Gobbi (Bocconi University and University of Trento), we developed some economic and operational foundations of a new method of financing companies’ financial obligations  50. In this new banking business model, a network funder sets an optimal combination of netting and financing. Given a network of companies and their respective invoices, and under the condition of a full settlement of the invoices, we applied a multilateral netting algorithm to the network, conceived as an oriented multi-graph. Our problem, which is NP-complete, was to find a set of invoices which maximises the amount of debt reduced given a quantity of loanable funds.

To consolidate our approach of the problem, we analysed the data of a large economic network from an Italian invoice operator on a one-year span 21. We compared different methods to detect structures or communities that could be helpful for debt netting algorithms. Indeed, the structure of such networks is not currently well known. We gave hints on how to sort and identify the type of business-to-business invoice graphs, in particular, how to identify relevant communities in such networks.

10.1.1 Inria associate team not involved in an IIL or an international program

10.2.1 Visits of international scientists

• Martin Avanzini (Focus team, Inria Sophia) visited Emmanuel Hainry, Romain Péchoux, and Simon Perdrix in November 2023 (1 week, funded by the Inria associate team TC(Pro)${}^3$).
• Alejandro Diaz-Caro (CONICET Buenos Aires) visited Emmanuel Hainry, Romain Péchoux, and Simon Perdrix in November 2023 (1 month, funded by the Inria Chercheur Invité programme).
• Rebecca Smith (SUNY Brookport) visited Mathilde Bouvel for a week in March 2023.
• Nikolas Breuckmann (University of Bristol) and Oscar Higgot (University College London) visited Christophe Vuillot in January 2023 (1 week funded by the Inria associate team QASAR).

10.2.2 Visits to international teams

10.3.1 Horizon Europe

10.3.2 H2020 projects

10.3.3 Other european programs/initiatives

10.4.1 ANR

10.4.2 Other initiatives

11.1.1 Scientific events: organisation

11.1.2 Journal

11.1.3 Invited talks

• Nazim Fatès has given an invited talk at the workshop « Automates cellulaires, systèmes de particules, et auto-organisation », Rouen, November 15, 2023 ; he was invited to give a talk at the « Journée représentations du langage », Fédération Charles-Hermite, November 21, 2023, Nancy.
• Mathieu Hoyrup has been invited to give a talk at the workshop Recursion Theory and its Applications at the Institute for Advanced Study in Mathematics, Hangzhou.
• Romain Péchoux has given an invited talk at the SCOT seminar (online), 13th of January 2023, and a talk at the Complexity Days, GDR IM, 13rd of December 2023, Paris.
• Christophe Vuillot has given an invited talk at the CEA Leti Innovation Days, 28th of June 2023, Grenoble.

11.1.4 Leadership within the scientific community

• Mathilde Bouvel is a member of the steering committee of the conference series Permutation Patterns.
• Nazim Fatès is the chair of the IFIP working group 1.5 on Cellular Automata and Discrete Complex Systems.
• Christophe Vuillot is organizing the QASAR seminar, a regular online international seminar on quantum error correction, started in June 2023, once every two weeks, 29 connections on average.

11.1.5 Scientific expertise

• Mathilde Bouvel has been an external evaluator on an research project submitted to the ANR (generic call AAPG).
• Nazim Fatès evaluated a research project submitted to the National Science Center (Narodowe Centrum Nauki) in Poland.
• Mathieu Hoyrup has been evaluator on a Fondecyt research project.
• Romain Péchoux was expert and rapporteur for the MSCA HORIZON call.

11.1.6 Research administration

• Christophe Vuillot is a member of the scientific board of the GdR TeQ.
• Simon Perdrix is co-responsible, with Renaud Vilmart, of the groupe de travail Informatique Quantique at GdR IM.

11.2.1 Supervision

• PhD: Djamel Eddine Amir, “Computability of subsets of topological spaces”, Start: October 2020, Advisors: Emmanuel Jeandel and Mathieu Hoyrup. Djamel Defended in October 2023.
• PhD: Alexandre Clément, “Graphical Languages for Quantum Control”, Start: September 2019, Advisors: Emmanuel Jeandel and Simon Perdrix. Alexandre defended in May 2023.
• PhD: Agustin Borgna “Vers une formalisation d’une chaîne de compilation pour un ordinateur quantique”, Start: October 2019, Advisors: Simon Perdrix and Benoit Valiron (LMF). Agustin defended in January 2023.
• PhD in progress: Nathan Claudet, “Structures fondamentales et applications des états graphes et du calcul par mesures”, Start: October 2022, Advisors: Simon Perdrix and Mathilde Bouvel.
• PhD in progress, Kinnari Vijay Dave, “Quantum programming with (co)inductive types”, Start: December 2022, Advistors: Romain Péchoux and Vladimir Zamdzhiev.
• PhD in progress: Noé Delorme, “Wielding Quantum Circuits”, Start: July 2023, Advisors: Simon Perdrix.
• PhD in progress: Alexandre Guernut, “Efficient Fault-Tolerant Quantum Computation with Quantum LDPC Codes”, Start: October 2021, Advisors: Emmanuel Jeandel and Christophe Vuillot.
• PhD in progress: Joannès Guichon, “B2B exchange networks and liquidity-saving mechanism by mutualisation of debt”, Start: October 2022, Advisors: Nazim Fatès and Sylvain Contassot-Vivier.
• PhD in progress: Mario Machado Da Silva, “Computational complexity of reversible computations and applications to quantum programming”, Start: October 2021, Advisors: Emmanuel Hainry and Romain Péchoux.
• PhD in progress: Benjamin Testart, “Énumération et formes limites des tables d'inversions évitant des motifs”, Start: October 2022, Advisors: Mathilde Bouvel and Emmanuel Jeandel.
• PhD in progress: Vivien Vandaele, “Optimisation du calcul quantique tolérant aux fautes par le ZX-Calculus”, Start: September 2021, Advisors: Simon Perdrix and Christophe Vuillot, joint supervision with Simon Martiel at ATOS (CIFRE).

11.2.2 Juries

• Mathilde Bouvel participated in the PhD defense of Daniel Tamayo Jimenez (Université Paris-Saclay).
• Nazim Fatès reviewed the PhD manuscript of Witold Bołt (Polish Academy of Science, Warsaw, Poland).
• Emmanuel Jeandel participated in the PhD defense of David Desobry (Université de Lorraine) and the HDR defenses of Mathieu Hoyrup and Nazim Fatès (Université de Lorraine).
• Emmanuel Jeandel reviewed the PhD manuscript of Kostia Chardonnet (Université Paris-Saclay)
• Emmanuel Jeandel reviewed the HDR manuscript of Damien Regnault (Université d'Evry)
• Simon Perdrix was external examinator for the PhD defense of Matthew Wilson (University of Oxford).
• Simon Perdrix participated in the PhD defense of Marc Bataille (Université de Rouen).
• Simon Perdrix was the president of the jury of Quentin Yang (Université de Lorraine).

11.3.1 Interventions

• Nazim Fatès: talk destined to the classes of the Collège Jean-Lurçat, Frouard, on the work of Alan TURING, May 31, 2023. An article in L'est republicain covered this event.
• Nazim Fatès: talk to a wide audience in Marsal, a village near Nancy: «Intelligence artificielle, qu’en dirait Socrate ?». An article appeared in Le républicain lorrain to present this meeting.
• Nazim Fatès: talk to a wide audience in Strasbourg, «Intelligence artificielle : qu’y a-t-il de l’autre côté du miroir ?», jointly with Amélie Cordier (independent), organised by the association Le Jardin des sciences, October 5, 2023.
• Nazim Fatès: talk to high-school and undergraduate students, as well as to large-audience public (approx. 300 persons in total), in Espace Sadoul, Saint-Dié-des-Vosges, for « La fête de la science », jointly with Marie Baron (Université de Lorraine), October 10, 2023.
• Nazim Fatès: Radio interview with Bénédicte Bossard, RCF Strasbourg, Le Grand Entretien, «Intelligence artificielle : puiser dans les sciences humaines face au débat », November 6, 2023 (read podcast). This interview followed the meeting in Strasbourg.
• Mathieu Hoyrup gave an introductory talk to MP2I students from Lycée Henri Poincaré on the topic of game theory.

International journals

• 9 articleM.Michael Albert, M.Mathilde Bouvel, V.Valentin Féray and M.Marc Noy. Convergence law for 231-avoiding permutations.Discrete Mathematics and Theoretical Computer Science2024HALback to text
• 10 articleD. E.Djamel Eddine Amir and M.Mathieu Hoyrup. Comparing computability in two topologies.The Journal of Symbolic Logic2023, 1-19HALDOIback to text
• 11 articleD. E.Djamel Eddine Amir and M.Mathieu Hoyrup. Strong computable type.Computability123September 2023, 227-269HALDOIback to text
• 12 articleJ.-C.Jean-Christophe Aval, A.Adrien Boussicault, M.Mathilde Bouvel, O.Olivier Guibert and M.Matteo Silimbani. Baxter Tree-like Tableaux.The Australasian Journal of Combinatorics8612023, 24--75HALDOIback to text
• 13 articleR. I.Robert I. Booth, A.Aleks Kissinger, D.Damian Markham, C.Clément Meignant and S.Simon Perdrix. Outcome determinism in measurement-based quantum computation with qudits.Journal of Physics A: Mathematical and Theoretical5611February 2023, 115303HALDOIback to text
• 14 articleR. I.Robert I. Booth and D.Damian Markham. Flow conditions for continuous variable measurement-based quantum computing.Quantum7October 2023, 1146HALDOI
• 15 articleM.Mathieu Hoyrup, T.Takayuki Kihara and V.Victor Selivanov. Degree Spectra of Homeomorphism Types of Compact Polish Spaces.The Journal of Symbolic Logic2023, 1-32HALDOIback to text
• 16 articleM.Mathieu Hoyrup. Notes on overt choice.ComputabilityApril 2023, 1-19HALDOIback to text

International peer-reviewed conferences

• 17 inproceedingsA.Alexandre Clément, N.Noé Delorme, S.Simon Perdrix and R.Renaud Vilmart. Quantum Circuit Completeness: Extensions and Simplifications.International Conference on Computer Science Logic CSL 2024Naples, ItalyFebruary 2024HALback to text
• 18 inproceedingsA.Alexandre Clément, N.Nicolas Heurtel, S.Shane Mansfield, S.Simon Perdrix and B.Benoît Valiron. A Complete Equational Theory for Quantum Circuits.38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)Boston, United StatesIEEEJuly 2023, 1-13HALDOIback to textback to text
• 19 inproceedingsL.-J.Liliane-Joy Dandy, E.Emmanuel Jeandel and V.Vladimir Zamdzhiev. Type-safe Quantum Programming in Idris.Lecture Notes in Computer ScienceESOP 2023 - European Symposium on ProgrammingLNCS-13990Programming Languages and SystemsParis, FranceSpringerApril 2023, 507-534HALDOIback to text
• 20 inproceedingsN.Nazim Fatès, R.Régine Marchand and I.Irène Marcovici. A decentralised diagnosis method with probabilistic cellular automata.LNCSCellular Automata and Discrete Complex Systems. AUTOMATA 202314152Trieste (Italy), FranceSpringerAugust 2023HALDOIback to text
• 21 inproceedingsJ.Joannès Guichon, N. A.Nazim A. Fatès, S.Sylvain Contassot-Vivier and M.Massimo Amato. Properties of B2B invoice graphs and detection of structures.Complex Networks 2023Menton, FranceNovember 2023HALback to textback to text
• 22 inproceedingsE.Emmanuel Hainry and R.Romain Péchoux. A General Noninterference Policy for Polynomial Time.POPL 237Boston, United StatesJanuary 2023, 806 - 832HALDOIback to textback to text
• 23 inproceedingsE.Emmanuel Hainry, R.Romain Péchoux and M.Mário Silva. A programming language characterizing quantum polynomial time.Foundations of Software Science and Computation Structures - 26th International Conference, FoSSaCS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2023, Paris, France, April 22-27, 2023, ProceedingsParis, FranceApril 2023HALDOIback to text
• 24 inproceedingsV.Vivien Vandaele, S.Simon Martiel, S.Simon Perdrix and C.Christophe Vuillot. Optimal Hadamard gate count for Clifford+T synthesis of Pauli rotations sequences.TQC 2023: 18th Theory of Quantum Computation, Communication and CryptographyAveiro, PortugalJuly 2023HALback to text

Conferences without proceedings

• 25 inproceedingsA.Alexandre Clément, N.Nicolas Heurtel, S.Shane Mansfield, S.Simon Perdrix and B.Benoît Valiron. A Complete Equational Theory for Quantum Circuits.Theory of Quantum Computation, Communication and Cryptography (TQC 2023)Aveiro, PortugalJuly 2023HALback to text
• 26 inproceedingsL.Louis Paletta, A.Anthony Leverrier, A.Alain Sarlette, M.Mazyar Mirrahimi and C.Christophe Vuillot. Robust sparse IQP sampling in constant depth.QIP2024Taipei, TaiwanJuly 2023HALback to textback to text

Doctoral dissertations and habilitation theses

• 27 thesisD. E.Djamel Eddine Amir. Computability of Topological Spaces.Université de LorraineOctober 2023HAL
• 28 thesisA.Agustín Borgna. Towards a formal compilation stack-frame in quantum computing.Université de LorraineJanuary 2023HAL
• 29 thesisA.Alexandre Clément. Graphical Languages for Quantum Control and Linear Optics.Université de LorraineMay 2023HAL
• 30 thesisN. A.Nazim A. Fatès. Robustesse des systèmes complexes : étude du rôle de l’aléa dans la dynamique des automates cellulaires.Université de LorraineMay 2023HAL
• 31 thesisM.Mathieu Hoyrup. Topological Aspects of Representations in Computable Analysis.Université de LorraineJanuary 2023HAL

Reports & preprints

• 32 miscD. E.Djamel Eddine Amir and M.Mathieu Hoyrup. Descriptive complexity of topological invariants.September 2023HAL
• 33 miscD. E.Djamel Eddine Amir and M.Mathieu Hoyrup. The surjection property and computable type.June 2023HAL
• 34 miscM.Martin Avanzini, G.Georg Moser, R.Romain Péchoux and S.Simon Perdrix. On the Hardness of Analyzing Quantum Programs Quantitatively.December 2023HAL
• 35 miscN.Nathan Claudet, M.Mehdi Mhalla and S.Simon Perdrix. Small k-pairable states.December 2023HALback to text
• 36 miscA.Alexandre Clément, N.Noé Delorme and S.Simon Perdrix. Minimal Equational Theories for Quantum Circuits.November 2023HALback to text
• 37 miscA.Alejandro Díaz-Caro, E.Emmanuel Hainry, R.Romain Péchoux and M.Mário Silva. A feasible and unitary programming language with quantum control.November 2023HAL
• 38 miscG.Guilhem Gamard, P.Pierre Guillon, K.Kévin Perrot and G.Guillaume Theyssier. Hardness of monadic second-order formulae over succinct graphs.February 2023HAL
• 39 miscM.Marc Malenfer, M.Michael Sarrey, J.Jennifer Clerté, M.Michel Hery, M.Martin Bieri, B.Bertrand Braunschweig, R.Régis Chatellier, N.Nazim Fatès, S.Sylvain Halluin, F.François de Jouvenel, V.Vincent Mandinaud, J.Jorge Munoz, A.Anani Olympio, T.Thimotée Silvestre and J.-F.Jean-François Soupizet. Artificial intelligence in the service of health and safety at work: Perspectives and challenges from now to 2035 - A prospective study.November 2023HALDOI
• 40 miscV.Vivien Vandaele, S.Simon Martiel, S.Simon Perdrix and C.Christophe Vuillot. Optimal Hadamard gate count for Clifford+T synthesis of Pauli rotations sequences.February 2023HALback to text
• 41 miscC.Christophe Vuillot, A.Alessandro Ciani and B. M.Barbara M. Terhal. Homological Quantum Rotor Codes: Logical Qubits from Torsion.March 2023HALback to text

Scientific popularization

• 42 article N.Nazim Fatès. Que faire de l'expression intelligence artificielle ? Alliage : Culture - Science - Technique 2023 HAL