6.1.1 FiatLux

• Keywords:
  Cellular automaton, Multi-agent, Distributed systems
• 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.
• News of the Year:
  The latest version of the software incorporates improvements that were implemented by Océane Chazé, a second-year student at Télécom Nancy. She improved the User Interface by simplifying the interactions with the grid of cells. She also improved the software by introducing new features which allow users to encode initial conditions and transitions rules in a more elaborate way. This allows users to import some well-known models from external websites, e.g. Langton's self-reproducing rule or "classical" patterns in the Game of Life.
• URL:
  https://­project.­inria.­fr/­fiatlux/
• Contact:
  Nazim Fates
• Participants:
  Nazim Fates, Olivier Boure
• Partners:
  ENS Lyon, Université de Lorraine

6.1.2 ComplexityParser

• Name:
  ComplexityParser
• Keywords:
  Static analysis, Complexity, Static typing
• Functional Description:
  ComplexityParser is a static complexity analyzer for Java programs using a tier-based typing discipline. If a program is typable, this guarantees its runtime to be polynomial on the condition that it halts. The type inference is automatic, its complexity is linear in the size of the input program in practice.
• URL:
  https://­gitlab.­inria.­fr/­complexityparser/­complexityparser
• Contact:
  Romain Péchoux

6.1.3 Qimaera

• Name:
  Qimaera
• Keyword:
  Quantum programming
• Functional Description:
  Variational Quantum Algorithms 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. We introduce Qimaera, which is 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 Qimaera is suitable for variational quantum programming by providing implementations of the two most prominent variational quantum algorithms – QAOA and VQE. To the best of our knowledge, this is the first implementation of these algorithms that has been achieved in a type-safe framework.
• URL:
  https://­github.­com/­zamdzhiev/­Qimaera
• Publication:
  hal-03519238
• Contact:
  Vladimir Zamdzhiev
• Participants:
  Liliane-Joy Dandy, Emmanuel Jeandel, Vladimir Zamdzhiev

7.1.1 Fixed-point property for represented spaces

A space with a structure has the fixed-point property if every structure-preserving function from the space to itself has a fixed-point. We investigate which spaces have the fixed-point property for computable multivalued functions. We prove in particular that among the countably-based topological spaces, they are exactly the omega-continuous domains, an important class coming from semantics of programming languages. We apply our results to identify the complexity of indexing a basis of a topological space. Our article has been accepted in the Annals of Pure and Applied Logic 35.

7.1.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 obtained a topological characterization of this property for a large class of sets, namely the finite simplicial complexes. Our results give an easy way of determining whether a given set has computable type. In particular we have settled the question for famous sets from topology: the dunce hat, and Bing's house. An article is currently submitted.

We have also obtained a partial characterization of this property using homology theory. Essentially, this property is related to the fact that every point belongs to a cycle, a notion provided by homology, extending the notion of cycle in a graph. An article is in preparation.

7.2.1 Probabilistic cellular automata for problem solving

Directly related to the theme exposed in Sec. 4.3, we continued to explore the problem of self-stabilisation, as introduced by Dijkstra in the 1970’s, in the context of cellular automata  43. More precisely, we extended the scope of our results from $k$-colourings to shifts of finite type. We also presented various constructions and theorems that allow us to consolidate the framework of this problem. The last details for the presentation of our work have been worked out and our article has been accepted for a publication in Fundamenta informaticae 33.

Our work on a bio-inspired mechanism for data clustering has also been revised and is scheduled for a publication in 2022  53. Our method uses amoebae which evolve according to cellular automata rules: they contain the data to be processed and emit reaction-diffusion waves at random times. The waves transmit the information across the lattice and cause other amoebae to react, by being attracted or repulsed. The local reactions produce small homogeneous groups which progressively merge and realize the clustering at a larger scale.

We continued our work with Régine Marchand (IECL, Université de Lorraine) and Irène Marcovici on the problem of detecting failures in a distributed network  45. The question that drives our research is to find out how we can detect that the failure rate has exceeded a given threshold without any central authority when some components progressively break down.

7.2.2 Aperiodic tilesets

Our paper 12 with Michael Rao which proved the existence of an aperiodic set of 11 Wang tiles, along with the proof that this number is minimal, was published this year in Advances in Combinatorics. This work was done a few years ago and already available in public repositories (arXiv, HAL-Inria). It closed 50 years of research on this problem.

7.2.3 Diagrams for symbolic dynamics

One of the main open question in the field of symbolic dynamics is to decide whether the conjugacy problem is computable. This is a problem on shifts of finite type, that can be reformulated in terms of matrices. Two matrices $M$ and $N$ with nonnegative integer coefficients are said to be strong-shift-equivalent in one step if $M=RS$ and $N=SR$ for nonnecessarily square matrices $R$ and $S$ with nonnegative integer coefficients. Strong shift equivalence is the reflexive and transitive closure of this relation.

In 36 we show how to use results from category theory, in particular the concept of PROPs as used for instance in the ZX-calculus, to provide a purely categorical version of this question. Rather than just a technical exercise, we show in the same paper that we can recover many invariants of strong shift equivalence rather surprisingly by considering preexisting categories with bialgebras that are well known in mathematics. Whether the approach could lead to the computability of strong shift equivalence remains to be seen.

7.2.4 Analysis of graphs in the field of economics

In collaboration with colleagues form Bocconi University and University of Trento, we developed some economic and operational foundations of a new method of financing companies’ financial obligations 32. 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. We designed a policy which finds a trade-off and tested our methods on an empirical dataset from an electronic invoicing operator consisting of more than 60,000 companies. The first results show that this method is economically significant and feasible.

7.4.1 Random cographs

Cographs form one of the simplest hereditary graph classes. They can be defined as the graphs not containing the path with 4 vertices as an induced subgraph. A characterization of cographs which is essential for us is the following: cographs are the graphs which can be encoded by trees in a specific family, called cotrees.

We are interested in the asymptotic properties of uniform random cographs when the number of vertices tends to infinity.

In a first paper 11, we prove convergence towards a Brownian limiting object in the space of graphons, which we call the Brownian cographon. We then show that the degree of a uniform random vertex in a uniform cograph with $n$ vertices is of order $n$, and converges after normalization to the Lebesgue measure on $[0,1]$. We finally analyze the vertex connectivity (i.e. the minimal number of vertices whose removal disconnects the graph) of random connected cographs, and show that this statistics converges in distribution without renormalization. Our proofs use the encoding of cographs via cotrees, combined with the symbolic method and singularity analysis.

In a second paper 34, we focus on independent sets (or equivalently, cliques) in uniform random cographs. First, we prove that, with high probability as $n$ gets large, the largest independent set in a uniform random cograph with $n$ vertices has size $o\left(n\right)$, answering a question of Kang, McDiarmid, Reed and Scott. The proof relies on the convergence to the Brownian cographon, and on the self-similarity properties of this object. Second, and unexpectedly given the above results, we show that for $\beta >0$ sufficiently small, the expected number of independent sets of size $\beta n$ in a uniform random cograph with $n$ vertices grows exponentially fast with $n$. This time the proof relies on singularity analysis of the associated bivariate generating functions.

In 34, we also prove permutation analogues of all the results mentioned above.

7.4.2 Baxter Tree-like tableaux

The article 22 is the result of a collaboration started at LaBRI in 2012 (when M. Bouvel was there). We took the opportunity of the "work from home" situation to complete this work.

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.

7.4.3 Interval posets of permutations

The paper 26 results from the research internship of B. Izart in our team (June-September 2021), and from the visit of L. Cioni to Loria (September-October 2021).

The goal of this research project was to investigate the links between interval posets of permutations and substitution decomposition trees. The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in 54. Substitution decomposition trees, on the other hand, are a rather classical tool in the study of permutation classes, which was not used in 54.

We first describe a procedure to obtain the interval poset of a permutation from its substitution decomposition tree. We then give alternative proofs of some of the results in 54, and we solve the open problems that it posed (and some other enumerative problems) using techniques from symbolic and analytic combinatorics. Finally, we compute the Möbius function on interval posets.

7.5.1 Recursive types in substructural type systems

Recursive datatypes 39 in programming languages generalise inductive datatypes by allowing the programmer to construct more expressive types (e.g. streams) without imposing any restrictions on the admissible logical polarities of the underlying type expressions. As part of a larger program, we wish to understand how this can be achieved in quantum computation. However, before this question may be answered, it is useful to understand how such types behave in the setting of Substructural Type Systems, which quantum programming is a part of.

In this work, we describe a substructural type system with mixed linear and non-linear recursive types called LNL-FPC (the linear/non-linear fixpoint calculus). Just as in FPC, we show that LNL-FPC supports type-level recursion which in turn induces term-level recursion. We also provide sound and computationally adequate categorical models for LNL-FPC which describe the categorical structure of the substructural operations of Intuitionistic Linear Logic at all non-linear types, including the recursive ones. In order to do so, we describe a new technique for solving recursive domain equations. We also show that the requirements of our abstract model are reasonable by constructing a large class of concrete models that have found applications in classical programming, but also in emerging programming paradigms such as quantum programming and circuit description programming languages.

These results are published in the journal Logical Methods in Computer Science 13. The final revisions for the journal article were completed in 2021, but most of the work was done in 2020. This work is also an extended version of our paper that was published in ICFP'19 50.

7.5.2 Commutative monads for probabilistic programming languages

Domain theory47, a mathematical theory that is a staple of denotational semantics, provides an elegant order-theoretic view of computation. However, domain theory has struggled to keep up with advances in probabilistic computation, because adding probabilistic choice to the domain-theoretic approach to semantics has been a challenge. The canonical model of (sub)probability measures in domain theory is the family of valuations - certain maps from the lattice of open subsets of a dcpo (directed-complete partial order) to the unit interval. These valuations form a strong monad $𝒱$ on $\mathrm{𝐃𝐂𝐏𝐎}$ (the category of dcpo’s and Scott-continuous functions) 48. However, whether this monad $𝒱$ is commutative (a very desirable property for the semantics) has been an open problem since 1989.

As part of this research project, we present three commutative submonads of $𝒱$ and a general topological method for finding even more. Our results ameliorate, to a large extent, the above 33 year old open problem. We show how to use our monads to provide a sound and adequate denotational semantics for the Probabilistic FixPoint Calculus (PFPC) – a call-by-value simply-typed lambda calculus with mixed-variance recursive types, term recursion and probabilistic choice. We also show that in the special case where we consider continuous dcpo’s, then all three monads coincide with the valuations monad $𝒱$ and we fully characterise the induced Eilenberg-Moore categories by showing that they are all isomorphic to the category of continuous Kegelspitzen of Keimel and Plotkin 49. These results are published in LICS'21 10.

The above results show that the three submonads we identified are suitable for modeling discrete probabilistic choice. Whether they can be used to model continuous probabilistic choice is unclear, because we do not know if they contain enough valuations. In order to tackle this question, we present a fourth commutative submonad of $𝒱$, called the central valuations monad, denoted $𝒵$. Unlike the previous three monads, which are constructed via topological methods, here we use algebraic ideas in order to define $𝒵.$ This monad is larger than our previous three monads and it might be the largest commutative one possible. In fact, $𝒱=𝒵$ iff $𝒱$ is commutative (open problem for 33 years). We also present some evidence that this monad is large enough to model continuous probabilistic choice, but a definitive answer to this question is left for future work. These results are published in CALCO'21 19.

7.5.3 Variational quantum programming in idris

Variational Quantum Algorithms 52, 51, 42 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 42 and VQE 52. 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 are described in a preprint, currently under peer-review 31. 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.

7.5.4 Semantics for variational quantum programming

The results in the previous research project show how we may approach variational quantum programming within an existing programming language. As part of this research project, we adopt a more theoretical and formal viewpoint and we consider a type system for variational quantum programming and we show how to design a suitable mathematical semantics for it.

In particular, we consider a programming language that can manipulate both classical and quantum information. Our language is type-safe and designed for variational quantum programming. The classical subsystem of the language is the Probabilistic FixPoint Calculus (PFPC), which is a lambda calculus with mixed-variance recursive types, term recursion and probabilistic choice. The quantum subsystem is a first-order linear type system that can manipulate quantum information. The two subsystems are related by mixed classical/quantum terms that specify how classical probabilistic effects are induced by quantum measurements, and conversely, how classical (probabilistic) programs can influence the quantum dynamics. We also describe a sound and computationally adequate denotational semantics for the language. Classical probabilistic effects are interpreted using a recently-described commutative probabilistic monad on $\mathrm{𝐃𝐂𝐏𝐎}$ (see Subsection 7.5.2). Quantum effects and resources are interpreted in a category of von Neumann algebras that we show is enriched over (continuous) domains. This strong sense of enrichment allows us to develop novel semantic methods that we use to interpret the relationship between the quantum and classical probabilistic effects. By doing so we provide the first denotational analysis that relates models of classical probabilistic programming to models of quantum programming.

The results of this project are published in POPL'22 17 and most of the work was done in the year 2021.

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

9.1.2 STIC/MATH/CLIMAT AmSud project

9.2.1 FP7 & H2020 projects

9.2.2 Other european programs/initiatives

9.3.1 ANR

9.3.2 Other initiatives

10.1.1 Scientific events: organisation

• Mathieu Hoyrup co-organized a Dagstuhl seminar on Descriptive Set Theory and Computable Topology in November (link)
• Simon Perdrix co-organized a school on Quantum computing and Operational Research, in November at Montpellier (link)

10.1.2 Journal

10.1.3 Invited talks

• Emmanuel Jeandel was invited to present his work in the French event “Journées SDA2” in Caen, November 2021.
• Nazim Fatès was invited to present his work on robust computing with cellular automata in a international online series of seminars on cellular automata. The talk is available on a YouTube recording. In November, this conference was given again for the researchers of the university of Sao Paolo, Brazil.
• Mathieu Hoyrup was invited to give a talk at the third Workshop on Digitalization and Computable Models WDCM in Novosibirsk (online), June 2021. He was also invited to give a talk at a minisymposium on at the Joint Annual Conference of the German Mathematical Society (DMV) and the Austrian Mathematical Society (ÖMG) 2021 (link) in Passau (online), September 2021.
• Simon Perdrix gave an invited seminar at Collège de France : "Langages graphiques pour programmer et raisonner en informatique quantique" (May 2021) (link).
• Vladimir Zamdzhiev gave an invited talk at the international event "Logic, Quantum Computing, and Artificial Intelligence" on 03.07.2021 titled "Semantics for Variational Quantum Programming".
• Christophe Vuillot gave an invited talk at the IRMA (Strasbourg, France) Physics and Mathematics Colloquim Quantum computing and Quantum information on 24.06.2021 titled `The Challenge of Universal and Fault-Tolerant Quantum Computation”.

10.1.4 Leadership within the scientific community

• Nazim Fatès was appointed as the chair of the IFIP Working Group 1.5 on Cellular automata and discrete complex systems.
• Vladimir Zamdzhiev was invited to be a member of the IFIP TC1/TC2 Working Group on Foundations of Quantum Computation, which is currently under creation and is expected to be formed in early 2022.

10.1.5 Scientific expertise

• Nazim Fatès was a member on a working group on the prospective of the use of artificial intelligence in the labour world. This national group, initiated by the INRS institute, is composed of about 20 persons and prepares a report and a national presentation on the effects of artificial intelligence on working conditions in a ten-year horizon, with a special emphasis on the security of persons.

10.2.1 Supervision

• PhD: Titouan Carette, “Langage diagrammatique pour l'ordinateur quantique”, Start: October 2018, Advisors: Emmanuel Jeandel and Simon Perdrix. Titouan defended in November 2021 21.
• PhD in progress: Djamel Eddine Amir, “Computability of subsets of topological spaces”, Start: October 2020, Advisors: Emmanuel Jeandel and Mathieu Hoyrup.
• PhD in progress: Alexandre Clément, “Graphical Languages for Quantum Control”, Start: September 2019, Advisors: Emmanuel Jeandel and Simon Perdrix.
• PhD in progress: Robert Booth, “Formalismes pour la vérification de technologies quantiques”, Start: November 2018, Advisors: Damian Markham and Simon Perdrix.
• PhD in progress: 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).
• 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: 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).
• PhD in progress: Margarita Veshchezerova, “Quantum Computing for Combinatorial Optimisation”, Start: October 2019, Advisors: Emmanuel Jeandel and Simon Perdrix, joint supervision with Marc Porcheron at EDF (CIFRE).

10.2.2 Juries

• Emmanuel Jeandel participated in the PhD defense of Henri de Boutray (Université de Franche-Comté)
• Emmanuel Jeandel participated in the HdR defense of Irène Marcovici (Université de Lorraine) and Nathalie Aubrun (Université Paris-Saclay)
• Emmanuel Jeandel reviewed the PhD manuscript of Pacôme Perrotin (Aix-Marseille University)
• Simon Perdrix participated in the PhD defense of Clément Meignat (Sorbonne Université)
• Simon Perdrix was external examiner in the PhD viva of Maria Stasinou (Oxford University)

10.3.1 Articles and contents

Nazim Fatès published an article for the wide-audience online magazine The conversation. The article, « Le temps passe-t-il pour l'intelligence artificielle ?» presents some reflection on the question of temporality and artificial intelligence.

Nazim Fatès published a video on Alan Turing, « La machine de Turing, un modèle pour le calcul ? ». This video is available on YouTube; it was realised with the audiovisual services of the Université de Lorraine and released for the "Fête de la science".

Simon Perdrix has been interviewed by Olivier Ezratty and Fanny Bouton in "Decode Quantum" (link)

10.3.2 Interventions

Nazim Fatès gave a series of lectures destined to a wide audience on the theme of artificial intelligence:

• « AI-calypse Now : comment l'intelligence artificielle a-t-elle muté pour devenir un enjeu planétaire ? », AI now conference, online presentation, June 3, 2021.
• « Visage(s) de l'intelligence artificielle », Troisième forum nancéien de l'IA en Santé, Centre Prouvé de Nancy, November 23, 2021.
• « Penser avec l'intelligence artificielle », Octobre 21, 2021, Association des émérites de l'université de Lorraine, Nancy.
• « AI-calypse now ! Quelques réflexions autour des limites de l'intelligence artificielle », Conference for the members of the laboratory Georessources, December 2021.

Nazim Fatès participated in a debate following a theatre play, We are The robots, ARTEM, Nancy, April 2, 2021.

International journals

• 11 articleF.Frédérique Bassino, M.Mathilde Bouvel, V.Valentin Féray, L.Lucas Gerin, M.Mickaël Maazoun and A.Adeline Pierrot. Random cographs: Brownian graphon limit and asymptotic degree distribution.Random Structures and AlgorithmsJuly 2021
  HALDOIback to text
• 12 articleE.Emmanuel Jeandel and M.Michael Rao. An aperiodic set of 11 Wang tiles.Advances in CombinatoricsJanuary 2021
  HALDOIback to text
• 13 articleB.Bert Lindenhovius, M.Michael Mislove and V.Vladimir Zamdzhiev. LNL-FPC: The Linear/Non-linear Fixpoint Calculus.Logical Methods in Computer ScienceApril 2021
  HALDOIback to text

International peer-reviewed conferences

• 14 inproceedingsC.Cyril Branciard, A.Alexandre Clément, M.Mehdi Mhalla and S.Simon Perdrix. Coherent Control and Distinguishability of Quantum Channels via PBS-Diagrams.46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)202Leibniz International Proceedings in Informatics (LIPIcs)Tallinn, EstoniaAugust 2021, 22:1-22:20
  HALDOI
• 15 inproceedingsT.Titouan Carette, M.Marc De Visme and S.Simon Perdrix. Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory.ACM/IEEE Symposium on Logic in Computer Science (LICS)36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)Rome, ItalyJune 2021
  HAL
• 16 inproceedingsE.Emmanuel Hainry, E.Emmanuel Jeandel, R.Romain Péchoux and O.Olivier Zeyen. ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs.ICTAC 2021 - 18th International Colloquium on Theoretical Aspects of Computing12819Theoretical Aspects of Computing – ICTAC 2021Nur-Sultan/Virtual, KazakhstanAugust 2021, 357-365
  HALDOIback to text
• 17 inproceedingsX.Xiaodong Jia, A.Andre Kornell, B.Bert Lindenhovius, M.Michael Mislove and V.Vladimir Zamdzhiev. Semantics for Variational Quantum Programming.49th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2022)Philadelphia, United StatesJanuary 2022
  HALDOIback to text
• 18 inproceedingsX.Xiaodong Jia, B.Bert Lindenhovius, M.Michael Mislove and V.Vladimir Zamdzhiev. Commutative Monads for Probabilistic Programming Languages.2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)LICS '21: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science19Rome, ItalyIEEEJune 2021, 1-14
  HALDOI
• 19 inproceedingsX.Xiaodong Jia, M.Michael Mislove and V.Vladimir Zamdzhiev. The Central Valuations Monad.CALCO 2021 - 9th International Conference on Algebra and Coalgebra in Computer ScienceSalzburg, AustriaAugust 2021
  HALDOIback to text

Conferences without proceedings

• 20 inproceedingsS.Simon Perdrix, A.Agustín Borgna and B.Benoît Valiron. Hybrid Quantum-Classical Circuit Simplification with the ZX-Calculus.Asian Symposium on Programming Languages and Systems (APLAS) 202113008Lecture Notes in Computer ScienceChicago, United StatesSpringer International PublishingOctober 2021, 121-139
  HALDOI

Doctoral dissertations and habilitation theses

• 21 thesisT.Titouan Carette. Wielding the ZX-calculus, Flexsymmetry, Mixed States, and Scalable Notations.Université de LorraineNovember 2021
  HALback to text

Reports & preprints

• 22 miscJ.-C.Jean-Christophe Aval, A.Adrien Boussicault, M.Mathilde Bouvel, O.Olivier Guibert and M.Matteo Silimbani. Baxter Tree-like Tableaux.October 2021
  HALback to text
• 23 miscR. I.Robert I. Booth, U.Ulysse Chabaud and P.-E.Pierre-Emmanuel Emeriau. Contextuality and Wigner negativity are equivalent for continuous-variable quantum measurements.January 2022
  HAL
• 24 miscR. 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.September 2021
  HAL
• 25 miscR. I.Robert I. Booth and D.Damian Markham. Flow conditions for continuous variable measurement-based quantum computing.May 2021
  HAL
• 26 miscM.Mathilde Bouvel, L.Lapo Cioni and B.Benjamin Izart. The interval posets of permutations seen from the decomposition tree perspective.November 2021
  HALback to text
• 27 miscT.Titouan Carette. A note on diagonal gates in SZX-calculus.February 2021
  HAL
• 28 miscT.Titouan Carette. When Only Topology Matters.February 2021
  HAL
• 29 miscD.Daniel Coronel, A.Alexander Frank, M.Mathieu Hoyrup and C.Cristóbal Rojas. Realizing semicomputable simplices by computable dynamical systems.September 2021
  HAL
• 30 miscC.Constantin Dalyac, L.Loïc Henriet, E.Emmanuel Jeandel, W.Wolfgang Lechner, S.Simon Perdrix, M.Marc Porcheron and M.Margarita Veshchezerova. Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehicles.January 2021
  HAL
• 31 miscL.-J.Liliane-Joy Dandy, E.Emmanuel Jeandel and V.Vladimir Zamdzhiev. Qimaera: Type-safe (Variational) Quantum Programming in Idris.January 2022
  HALback to textback to text
• 32 miscN. A.Nazim A. Fatès, M.Massimo Amato and L.Lucio Gobbi. The economics and algorithmics of an integral settlement procedure on B2B network.December 2021
  HALback to text
• 33 miscN. A.Nazim A. Fatès, I.Irène Marcovici and S.Siamak Taati. Self-stabilisation of cellular automata on tilings.February 2021
  HALback to text
• 34 miscV.Valentin Feray, F.Frédérique Bassino, M.Mathilde Bouvel, M.Michael Drmota, L.Lucas Gerin, M.Mickaël Maazoun and A.Adeline Pierrot. Linear-sized independent sets in random cographs and increasing subsequences in separable permutations.October 2021
  HALback to textback to text
• 35 miscM.Mathieu Hoyrup. The fixed-point property for represented spaces.January 2021
  HALback to text
• 36 miscE.Emmanuel Jeandel. Strong shift equivalence as a category notion.July 2021
  HALback to text
• 37 miscC.Christophe Vuillot. Planar Floquet Codes.October 2021
  HAL

Scientific popularization

• 38 article N. A.Nazim A. Fatès. Le temps passe-t-il pour l’intelligence artificielle ? The Conversation July 2021
  HAL