Simon Perdrix

Orcid: 0000-0002-1808-2409

According to our database1, Simon Perdrix authored at least 76 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Covering a Graph with Minimal Local Sets.
CoRR, 2024

Vertex-minor universal graphs for generating entangled quantum subsystems.
CoRR, 2024

On the Hardness of Analyzing Quantum Programs Quantitatively.
Proceedings of the Programming Languages and Systems, 2024

Quantum Circuit Completeness: Extensions and Simplifications.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023
Minimal Equational Theories for Quantum Circuits.
CoRR, 2023

Simple Complete Equational Theories for Quantum Circuits with Ancillae or Partial Trace.
CoRR, 2023

A Complete Equational Theory for Quantum Circuits.
LICS, 2023

2022
LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits.
CoRR, 2022

Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-Calculus.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

LO_v-Calculus: A Graphical Language for Linear Optical Quantum Circuits.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Quantum Expectation Transformers for Cost Analysis.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Addition and Differentiation of ZX-Diagrams.
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021
Quantum Algorithms and Oracles with the Scalable ZX-calculus.
Proceedings of the Proceedings 18th International Conference on Quantum Physics and Logic, 2021

Coherent Control and Distinguishability of Quantum Channels via PBS-Diagrams.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Hybrid Quantum-Classical Circuit Simplification with the ZX-Calculus.
Proceedings of the Programming Languages and Systems - 19th Asian Symposium, 2021

2020
Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus.
Quantum, 2020

Reversible causal graph dynamics: invertibility, block representation, vertex-preservation.
Nat. Comput., 2020

Completeness of the ZX-Calculus.
Log. Methods Comput. Sci., 2020

Towards a Minimal Stabilizer ZX-calculus.
Log. Methods Comput. Sci., 2020

Contextuality in multipartite pseudo-telepathy graph games.
J. Comput. Syst. Sci., 2020

Colored props for large scale graphical reasoning.
CoRR, 2020

PBS-calculus: A Graphical Language for Quantum-Controlled Computations.
CoRR, 2020

PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

2019
Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms.
Proceedings of the Proceedings 16th International Conference on Quantum Physics and Logic, 2019

SZX-Calculus: Scalable Graphical Quantum Reasoning.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Completeness of Graphical Languages for Mixed States Quantum Mechanics.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Approches Graphiques en Informatique Quantique.
, 2019

2018
Quantum Computation and Information - Introduction to the Special Theme.
ERCIM News, 2018

Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
Generalised Supplementarity and new rule for Empty Diagrams to Make the ZX-Calculus More Expressive.
CoRR, 2017

Y-Calculus: A language for real Matrices derived from the ZX-Calculus.
Proceedings of the Proceedings 14th International Conference on Quantum Physics and Logic, 2017

A complete characterisation of All-versus-Nothing arguments for stabiliser states.
CoRR, 2017

ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Determinism and Computational Power of Real Measurement-Based Quantum Computation.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016
Contextuality in multipartie pseudo-telepathy graph games.
CoRR, 2016

A Simplified Stabilizer ZX-calculus.
Proceedings of the Proceedings 13th International Conference on Quantum Physics and Logic, 2016

Reversible Causal Graph Dynamics.
Proceedings of the Reversible Computation - 8th International Conference, 2016

Supplementarity is Necessary for Quantum Diagram Reasoning.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015
On weak odd domination and graph-based quantum secret sharing.
Theor. Comput. Sci., 2015

Quantum Circuits for the Unitary Permutation Problem.
Proceedings of the Theory and Applications of Models of Computation, 2015

Reversibility in Extended Measurement-Based Quantum Computation.
Proceedings of the Reversible Computation - 7th International Conference, 2015

Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Block Representation of Reversible Causal Graph Dynamics.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014
Call-by-value, call-by-name and the vectorial behaviour of the algebraic λ-calculus
Log. Methods Comput. Sci., 2014

The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes.
Proceedings of the Theory and Applications of Models of Computation, 2014

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

Pivoting makes the ZX-calculus complete for real stabilizers.
Proceedings of the 10th International Workshop on Quantum Physics and Logic, 2013

Access Structure in Graphs in High Dimension and Application to Secret Sharing.
Proceedings of the 8th Conference on the Theory of Quantum Computation, 2013

Parameterized Complexity of Weak Odd Domination Problems.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

2012
Parametrized Complexity of Weak Odd Domination Problems
CoRR, 2012

On the Minimum Degree Up to Local Complementation: Bounds and Complexity.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

New Protocols and Lower Bounds for Quantum Secret Sharing with Graph States.
Proceedings of the Theory of Quantum Computation, 2012

Quantum Secret Sharing with Graph States.
Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

2011
Towards Observable Quantum Turing Machines: Fundamentals, Computational Power, and Universality.
Int. J. Unconv. Comput., 2011

Completeness of algebraic CPS simulations
Proceedings of the Proceedings 7th International Workshop on Developments of Computational Methods, 2011

Optimal accessing and non-accessing structures for graph protocols
CoRR, 2011

Which Graph States are Useful for Quantum Information Processing?
Proceedings of the Theory of Quantum Computation, Communication, and Cryptography, 2011

2010
Environment and classical channels in categorical quantum mechanics
Log. Methods Comput. Sci., 2010

Computational Depth Complexity of Measurement-Based Quantum Computation.
Proceedings of the Theory of Quantum Computation, Communication, and Cryptography, 2010

Rewriting Measurement-Based Quantum Computations with Generalised Flow.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Information Flow in Secret Sharing Protocols.
Proceedings of the Proceedings Fifth Workshop on Developments in Computational Models--Computational Models From Nature, 2009

Graph States and the Necessity of Euler Decomposition.
Proceedings of the Mathematical Theory and Computational Practice, 2009

2008
Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition.
Proceedings of the Joint 5th International Workshop on Quantum Physics and Logic and 4th Workshop on Developments in Computational Models, 2008

Bases in Diagrammatic Quantum Protocols.
Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics, 2008

Quantum Entanglement Analysis Based on Abstract Interpretation.
Proceedings of the Static Analysis, 15th International Symposium, 2008

Finding Optimal Flows Efficiently.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
A Hierarchy of Quantum Semantics.
Proceedings of the Third International Workshop on Developments in Computational Models, 2007

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).
PhD thesis, 2006

Towards a Quantum Calculus: (Work in Progress, Extended Abstract).
Proceedings of the 4th International Workshop on Quantum Programming Languages, 2006

Resources Required for Preparing Graph States.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005
Classically-controlled Quantum Computation.
Proceedings of the First International Workshop on Developments in Computational Models, 2005

Quantum Patterns and Types for Entanglement and Separability.
Proceedings of the 3rd International Workshop on Quantum Programming Languages, 2005


  Loading...