ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics. - Emmanuel Jeandel; Simon Perdrix; Renaud Vilmart; Quanlong Wang (MFCS, 2017)

Y-Calculus: A language for real Matrices derived from the ZX-Calculus. - Emmanuel Jeandel; Simon Perdrix; Renaud Vilmart (QPL, 2017)

Generalised Supplementarity and new rule for Empty Diagrams to Make the ZX-Calculus More Expressive. - Emmanuel Jeandel; Simon Perdrix; Renaud Vilmart; Quanlong Wang (CoRR, 2017)

A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics. - Emmanuel Jeandel; Simon Perdrix; Renaud Vilmart (LICS, 2018)

Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics. - Emmanuel Jeandel; Simon Perdrix; Renaud Vilmart (LICS, 2018)

A ZX-Calculus with Triangles for Toffoli-Hadamard, Clifford+T, and Beyond. - Renaud Vilmart (QPL, 2018)

Completeness of Graphical Languages for Mixed States Quantum Mechanics. - Titouan Carette; Emmanuel Jeandel; Simon Perdrix; Renaud Vilmart (ICALP, 2019)

A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness. - Emmanuel Jeandel; Simon Perdrix; Renaud Vilmart (LICS, 2019)

A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics. - Renaud Vilmart (LICS, 2019)

ZX-Calculi for Quantum Computing and their Completeness. (ZX-Calculs pour l'Informatique Quantique et leur Complétude). - Renaud Vilmart (2019)

Completeness of the ZX-Calculus. - Emmanuel Jeandel; Simon Perdrix; Renaud Vilmart (Log. Methods Comput. Sci., 2020)

The Structure of Sum-Over-Paths, its Consequences, and Completeness for Clifford. - Renaud Vilmart (FoSSaCS, 2021)

Geometry of Interaction for ZX-Diagrams. - Kostia Chardonnet; Benoît Valiron; Renaud Vilmart (MFCS, 2021)

Quantum Multiple-Valued Decision Diagrams in Graphical Calculi. - Renaud Vilmart (MFCS, 2021)

Formal Methods for Quantum Programs: A Survey. - Christophe Chareton; Sébastien Bardin; Dongho Lee; Benoît Valiron; Renaud Vilmart; Zhaowei Xu (CoRR, 2021)

Classical Simulation of Quantum Circuits with Partial and Graphical Stabiliser Decompositions. - Aleks Kissinger; John van de Wetering; Renaud Vilmart (TQC, 2022)

Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Clifford Hierarchy. - Renaud Vilmart (CoRR, 2022)

The Many-Worlds Calculus: Representing Quantum Control. - Kostia Chardonnet; Marc de Visme; Benoît Valiron; Renaud Vilmart (CoRR, 2022)

Formal Methods for Quantum Algorithms. - Christophe Chareton; Dongho Lee; Benoît Valiron; Renaud Vilmart; Sébastien Bardin; Zhaowei Xu (Handb. Formal Anal. Verification Cryptogr., 2023)

Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation. - Renaud Vilmart (CSL, 2023)

Compositionality of Planar Perfect Matchings: A Universal and Complete Fragment of ZW-Calculus. - Titouan Carette; Etienne Moutot; Thomas Perez; Renaud Vilmart (ICALP, 2023)

Complete Graphical Language for Hermiticity-Preserving Superoperators. - Titouan Carette; Timothée Hoffreumon; Émile Larroque; Renaud Vilmart (LICS, 2023)

Simple Complete Equational Theories for Quantum Circuits with Ancillae or Partial Trace. - Alexandre Clément; Noé Delorme; Simon Perdrix; Renaud Vilmart (CoRR, 2023)

Quantum Circuit Completeness: Extensions and Simplifications. - Alexandre Clément; Noé Delorme; Simon Perdrix; Renaud Vilmart (CSL, 2024)

Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing. - Renaud Vilmart (Log. Methods Comput. Sci., 2024)

Minimality in Finite-Dimensional ZW-Calculi. - Marc de Visme; Renaud Vilmart (CSL, 2025)

The Many-Worlds Calculus. - Kostia Chardonnet; Marc de Visme; Benoît Valiron; Renaud Vilmart (Log. Methods Comput. Sci., 2025)