Quantum Patterns and Types for Entanglement and Separability. - Simon Perdrix (QPL, 2005)

Classically-controlled Quantum Computation. - Simon Perdrix; Philippe Jorrand (DCM@ICALP, 2005)

Resources Required for Preparing Graph States. - Peter Høyer; Mehdi Mhalla; Simon Perdrix (ISAAC, 2006)

Towards a Quantum Calculus: (Work in Progress, Extended Abstract). - Philippe Jorrand; Simon Perdrix (QPL, 2006)

Modèles formels du calcul quantique : ressources, machines abstraites et calcul par mesure. (Formal models of quantum computing: resources, abstract machines and measurement-based quantum computing). - Simon Perdrix (2006)

A Hierarchy of Quantum Semantics. - Simon Perdrix (DCM@ICALP, 2007)

Finding Optimal Flows Efficiently. - Mehdi Mhalla; Simon Perdrix (ICALP (1), 2008)

Quantum Entanglement Analysis Based on Abstract Interpretation. - Simon Perdrix (SAS, 2008)

Bases in Diagrammatic Quantum Protocols. - Bob Coecke; Simon Perdrix; Éric Oliver Paquette (MFPS, 2008)

Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition. - Simon Perdrix (QPL/DCM@ICALP, 2008)

Graph States and the Necessity of Euler Decomposition. - Ross Duncan; Simon Perdrix (CiE, 2009)

Information Flow in Secret Sharing Protocols. - Elham Kashefi; Damian Markham; Mehdi Mhalla; Simon Perdrix (DCM, 2009)

Rewriting Measurement-Based Quantum Computations with Generalised Flow. - Ross Duncan; Simon Perdrix (ICALP (2), 2010)

Computational Depth Complexity of Measurement-Based Quantum Computation. - Dan E. Browne; Elham Kashefi; Simon Perdrix (TQC, 2010)

Environment and classical channels in categorical quantum mechanics - Bob Coecke; Simon Perdrix (Log. Methods Comput. Sci., 2010)

Which Graph States are Useful for Quantum Information Processing? - Mehdi Mhalla; Mio Murao; Simon Perdrix; Masato Someya; Peter S. Turner (TQC, 2011)

Optimal accessing and non-accessing structures for graph protocols - Sylvain Gravier; Jérôme Javelle; Mehdi Mhalla; Simon Perdrix (CoRR, 2011)

Completeness of algebraic CPS simulations - Ali Assaf 002; Simon Perdrix (DCM, 2011)

Towards Observable Quantum Turing Machines: Fundamentals, Computational Power, and Universality. - Simon Perdrix (Int. J. Unconv. Comput., 2011)

Quantum Secret Sharing with Graph States. - Sylvain Gravier; Jérôme Javelle; Mehdi Mhalla; Simon Perdrix (MEMICS, 2012)

New Protocols and Lower Bounds for Quantum Secret Sharing with Graph States. - Jérôme Javelle; Mehdi Mhalla; Simon Perdrix (TQC, 2012)

On the Minimum Degree Up to Local Complementation: Bounds and Complexity. - Jérôme Javelle; Mehdi Mhalla; Simon Perdrix (WG, 2012)

Parametrized Complexity of Weak Odd Domination Problems - David Cattanéo; Simon Perdrix (CoRR, 2012)

Parameterized Complexity of Weak Odd Domination Problems. - David Cattanéo; Simon Perdrix (FCT, 2013)

Access Structure in Graphs in High Dimension and Application to Secret Sharing. - Anne Marin; Damian Markham; Simon Perdrix (TQC, 2013)

Pivoting makes the ZX-calculus complete for real stabilizers. - Ross Duncan; Simon Perdrix (QPL, 2013)

Graph States, Pivot Minor, and Universality of (X, Z)-Measurements. - Mehdi Mhalla; Simon Perdrix (Int. J. Unconv. Comput., 2013)

The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes. - David Cattanéo; Simon Perdrix (TAMC, 2014)

Call-by-value, call-by-name and the vectorial behaviour of the algebraic λ-calculus - Ali Assaf 002; Alejandro Díaz-Caro; Simon Perdrix; Christine Tasson; Benoît Valiron (Log. Methods Comput. Sci., 2014)

Block Representation of Reversible Causal Graph Dynamics. - Pablo Arrighi; Simon Martiel; Simon Perdrix (FCT, 2015)

Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms. - David Cattanéo; Simon Perdrix (ISAAC, 2015)

Reversibility in Extended Measurement-Based Quantum Computation. - Nidhal Hamrit; Simon Perdrix (RC, 2015)

Quantum Circuits for the Unitary Permutation Problem. - Stefano Facchini; Simon Perdrix (TAMC, 2015)

On weak odd domination and graph-based quantum secret sharing. - Sylvain Gravier; Jérôme Javelle; Mehdi Mhalla; Simon Perdrix (Theor. Comput. Sci., 2015)

Supplementarity is Necessary for Quantum Diagram Reasoning. - Simon Perdrix; Quanlong Wang (MFCS, 2016)

Reversible Causal Graph Dynamics. - Pablo Arrighi; Simon Martiel; Simon Perdrix (RC, 2016)

A Simplified Stabilizer ZX-calculus. - Miriam Backens; Simon Perdrix; Quanlong Wang (QPL, 2016)

Contextuality in multipartie pseudo-telepathy graph games. - Peter Høyer; Mehdi Mhalla; Simon Perdrix (CoRR, 2016)

Determinism and Computational Power of Real Measurement-Based Quantum Computation. - Simon Perdrix; Luc Sanselme (FCT, 2017)

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

A complete characterisation of All-versus-Nothing arguments for stabiliser states. - Samson Abramsky; Rui Soares Barbosa; Giovanni Carù; Simon Perdrix (CoRR, 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)

Quantum Computation and Information - Introduction to the Special Theme. - Jop Briët; Simon Perdrix (ERCIM News, 2018)

Approches Graphiques en Informatique Quantique. - Simon Perdrix (2019)

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)

SZX-Calculus: Scalable Graphical Quantum Reasoning. - Titouan Carette; Dominic Horsman; Simon Perdrix (MFCS, 2019)

Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms. - Niel de Beaudrap; Ross Duncan; Dominic Horsman; Simon Perdrix (QPL, 2019)

Theoretical Computer Science: Computability, Decidability and Logic. - Olivier Bournez; Gilles Dowek; Rémi Gilleron; Serge Grigorieff; Jean-Yves Marion; Simon Perdrix; Sophie Tison (A Guided Tour of Artificial Intelligence Research (3) (III), 2020)

Theoretical Computer Science: Computational Complexity. - Olivier Bournez; Gilles Dowek; Rémi Gilleron; Serge Grigorieff; Jean-Yves Marion; Simon Perdrix; Sophie Tison (A Guided Tour of Artificial Intelligence Research (3) (III), 2020)

Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory. - Romain Péchoux; Simon Perdrix; Mathys Rennela; Vladimir Zamdzhiev (FoSSaCS, 2020)

PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations. - Alexandre Clément; Simon Perdrix (MFCS, 2020)

PBS-calculus: A Graphical Language for Quantum-Controlled Computations. - Alexandre Clément; Simon Perdrix (CoRR, 2020)

Colored props for large scale graphical reasoning. - Titouan Carette; Simon Perdrix (CoRR, 2020)

Contextuality in multipartite pseudo-telepathy graph games. - Anurag Anshu; Peter Høyer; Mehdi Mhalla; Simon Perdrix (J. Comput. Syst. Sci., 2020)

Towards a Minimal Stabilizer ZX-calculus. - Miriam Backens; Simon Perdrix; Quanlong Wang (Log. Methods Comput. Sci., 2020)

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

Reversible causal graph dynamics: invertibility, block representation, vertex-preservation. - Pablo Arrighi; Simon Martiel; Simon Perdrix (Nat. Comput., 2020)

Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus. - Ross Duncan; Aleks Kissinger; Simon Perdrix; John van de Wetering (Quantum, 2020)

Hybrid Quantum-Classical Circuit Simplification with the ZX-Calculus. - Agustín Borgna; Simon Perdrix; Benoît Valiron (APLAS, 2021)

Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory. - Titouan Carette; Marc de Visme; Simon Perdrix (LICS, 2021)

Coherent Control and Distinguishability of Quantum Channels via PBS-Diagrams. - Cyril Branciard; Alexandre Clément; Mehdi Mhalla; Simon Perdrix (MFCS, 2021)

Quantum Algorithms and Oracles with the Scalable ZX-calculus. - Titouan Carette; Yohann D'Anello; Simon Perdrix (QPL, 2021)

Quantum Expectation Transformers for Cost Analysis. - Martin Avanzini; Georg Moser; Romain Péchoux; Simon Perdrix; Vladimir Zamdzhiev (LICS, 2022)

LO_v-Calculus: A Graphical Language for Linear Optical Quantum Circuits. - Alexandre Clément; Nicolas Heurtel; Shane Mansfield; Simon Perdrix; Benoît Valiron (MFCS, 2022)

Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-Calculus. - Alexandre Clément; Simon Perdrix (MFCS, 2022)

LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits. - Alexandre Clément; Nicolas Heurtel; Shane Mansfield; Simon Perdrix; Benoît Valiron (CoRR, 2022)

A Complete Equational Theory for Quantum Circuits. - Alexandre Clément; Nicolas Heurtel; Shane Mansfield; Simon Perdrix; Benoît Valiron (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)

On the Hardness of Analyzing Quantum Programs Quantitatively. - Martin Avanzini; Georg Moser; Romain Péchoux; Simon Perdrix (ESOP (2), 2024)

Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems. - Maxime Cautrès; Nathan Claudet; Mehdi Mhalla; Simon Perdrix; Valentin Savin; Stéphan Thomassé (ICALP, 2024)

Minimal Equational Theories for Quantum Circuits. - Alexandre Clément; Noé Delorme; Simon Perdrix (LICS, 2024)

Covering a Graph with Minimal Local Sets. - Nathan Claudet; Simon Perdrix (WG, 2024)

Addition and Differentiation of ZX-diagrams. - Emmanuel Jeandel; Simon Perdrix; Margarita Veshchezerova (Log. Methods Comput. Sci., 2024)

Deciding Local Unitary Equivalence of Graph States in Quasi-Polynomial Time. - Nathan Claudet; Simon Perdrix (ICALP, 2025)

Local Equivalence of Stabilizer States: A Graphical Characterisation. - Nathan Claudet; Simon Perdrix (STACS, 2025)

A Quantum Programming Language for Coherent Control. - Kathleen Barsse; Romain Péchoux; Simon Perdrix (CoRR, 2025)