default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon Perdrix
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j12]Emmanuel Jeandel, Simon Perdrix, Margarita Veshchezerova:
Addition and Differentiation of ZX-diagrams. Log. Methods Comput. Sci. 20(2) (2024)- [c55]Alexandre Clément
, Noé Delorme, Simon Perdrix, Renaud Vilmart:
Quantum Circuit Completeness: Extensions and Simplifications. CSL 2024: 20:1-20:23 - [c54]Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix:
On the Hardness of Analyzing Quantum Programs Quantitatively. ESOP (2) 2024: 31-58 - [c53]Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, Stéphan Thomassé:
Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems. ICALP 2024: 36:1-36:18 - [c52]Alexandre Clément, Noé Delorme, Simon Perdrix:
Minimal Equational Theories for Quantum Circuits. LICS 2024: 27:1-27:14 - [i28]Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, Stéphan Thomassé:
Vertex-minor universal graphs for generating entangled quantum subsystems. CoRR abs/2402.06260 (2024) - [i27]Nathan Claudet, Simon Perdrix:
Covering a Graph with Minimal Local Sets. CoRR abs/2402.10678 (2024) - [i26]Nathan Claudet, Simon Perdrix:
Local equivalence of stabilizer states: a graphical characterisation. CoRR abs/2409.20183 (2024) - 2023
- [c51]Alexandre Clément, Nicolas Heurtel, Shane Mansfield, Simon Perdrix, Benoît Valiron:
A Complete Equational Theory for Quantum Circuits. LICS 2023: 1-13 - [i25]Alexandre Clément, Noé Delorme, Simon Perdrix, Renaud Vilmart:
Simple Complete Equational Theories for Quantum Circuits with Ancillae or Partial Trace. CoRR abs/2303.03117 (2023) - [i24]Alexandre Clément, Noé Delorme, Simon Perdrix:
Minimal Equational Theories for Quantum Circuits. CoRR abs/2311.07476 (2023) - [i23]Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix:
On the Hardness of Analyzing Quantum Programs Quantitatively. CoRR abs/2312.13657 (2023) - 2022
- [c50]Emmanuel Jeandel, Simon Perdrix, Margarita Veshchezerova:
Addition and Differentiation of ZX-Diagrams. FSCD 2022: 13:1-13:19 - [c49]Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev:
Quantum Expectation Transformers for Cost Analysis. LICS 2022: 10:1-10:13 - [c48]Alexandre Clément, Nicolas Heurtel, Shane Mansfield, Simon Perdrix, Benoît Valiron:
LO_v-Calculus: A Graphical Language for Linear Optical Quantum Circuits. MFCS 2022: 35:1-35:16 - [c47]Alexandre Clément, Simon Perdrix:
Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-Calculus. MFCS 2022: 36:1-36:15 - [i22]Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev:
Quantum Expectation Transformers for Cost Analysis. CoRR abs/2201.09361 (2022) - [i21]Alexandre Clément, Nicolas Heurtel, Shane Mansfield, Simon Perdrix, Benoît Valiron:
LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits. CoRR abs/2204.11787 (2022) - 2021
- [c46]Agustín Borgna, Simon Perdrix, Benoît Valiron:
Hybrid Quantum-Classical Circuit Simplification with the ZX-Calculus. APLAS 2021: 121-139 - [c45]Titouan Carette, Marc de Visme, Simon Perdrix:
Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory. LICS 2021: 1-13 - [c44]Cyril Branciard, Alexandre Clément, Mehdi Mhalla, Simon Perdrix:
Coherent Control and Distinguishability of Quantum Channels via PBS-Diagrams. MFCS 2021: 22:1-22:20 - [c43]Titouan Carette, Yohann D'Anello, Simon Perdrix:
Quantum Algorithms and Oracles with the Scalable ZX-calculus. QPL 2021: 193-209 - [i20]Cyril Branciard, Alexandre Clément, Mehdi Mhalla, Simon Perdrix:
Coherent control and distinguishability of quantum channels via PBS-diagrams. CoRR abs/2103.02073 (2021) - 2020
- [j11]Anurag Anshu, Peter Høyer, Mehdi Mhalla, Simon Perdrix:
Contextuality in multipartite pseudo-telepathy graph games. J. Comput. Syst. Sci. 107: 156-165 (2020) - [j10]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
Completeness of the ZX-Calculus. Log. Methods Comput. Sci. 16(2) (2020) - [j9]Miriam Backens, Simon Perdrix, Quanlong Wang:
Towards a Minimal Stabilizer ZX-calculus. Log. Methods Comput. Sci. 16(4) (2020) - [j8]Pablo Arrighi, Simon Martiel, Simon Perdrix:
Reversible causal graph dynamics: invertibility, block representation, vertex-preservation. Nat. Comput. 19(1): 157-178 (2020) - [j7]Ross Duncan, Aleks Kissinger, Simon Perdrix, John van de Wetering:
Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus. Quantum 4: 279 (2020) - [c42]Romain Péchoux, Simon Perdrix, Mathys Rennela, Vladimir Zamdzhiev:
Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory. FoSSaCS 2020: 562-581 - [c41]Alexandre Clément, Simon Perdrix:
PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations. MFCS 2020: 24:1-24:14 - [p2]Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, Sophie Tison:
Theoretical Computer Science: Computability, Decidability and Logic. A Guided Tour of Artificial Intelligence Research (3) (III) 2020: 1-50 - [p1]Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, Sophie Tison:
Theoretical Computer Science: Computational Complexity. A Guided Tour of Artificial Intelligence Research (3) (III) 2020: 51-89 - [i19]Alexandre Clément, Simon Perdrix:
PBS-calculus: A Graphical Language for Quantum-Controlled Computations. CoRR abs/2002.09387 (2020) - [i18]Titouan Carette, Simon Perdrix:
Colored props for large scale graphical reasoning. CoRR abs/2007.03564 (2020)
2010 – 2019
- 2019
- [b2]Simon Perdrix:
Approches Graphiques en Informatique Quantique. University of Lorraine, Nancy, France, 2019 - [c40]Titouan Carette, Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
Completeness of Graphical Languages for Mixed States Quantum Mechanics. ICALP 2019: 108:1-108:15 - [c39]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness. LICS 2019: 1-10 - [c38]Titouan Carette, Dominic Horsman, Simon Perdrix:
SZX-Calculus: Scalable Graphical Quantum Reasoning. MFCS 2019: 55:1-55:15 - [c37]Niel de Beaudrap, Ross Duncan, Dominic Horsman, Simon Perdrix:
Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms. QPL 2019: 85-105 - [i17]Ross Duncan, Aleks Kissinger, Simon Perdrix, John van de Wetering:
Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus. CoRR abs/1902.03178 (2019) - [i16]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
Completeness of the ZX-Calculus. CoRR abs/1903.06035 (2019) - [i15]Romain Péchoux, Simon Perdrix, Mathys Rennela, Vladimir Zamdzhiev:
Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory. CoRR abs/1910.09633 (2019) - 2018
- [c36]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics. LICS 2018: 559-568 - [c35]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics. LICS 2018: 569-578 - [i14]Jop Briët, Simon Perdrix:
Quantum Computation and Information - Introduction to the Special Theme. ERCIM News 2018(112) (2018) - 2017
- [c34]Anurag Anshu, Peter Høyer, Mehdi Mhalla, Simon Perdrix:
Contextuality in Multipartite Pseudo-Telepathy Graph Games. FCT 2017: 41-55 - [c33]Simon Perdrix, Luc Sanselme:
Determinism and Computational Power of Real Measurement-Based Quantum Computation. FCT 2017: 395-408 - [c32]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart, Quanlong Wang:
ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics. MFCS 2017: 11:1-11:13 - [c31]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
Y-Calculus: A language for real Matrices derived from the ZX-Calculus. QPL 2017: 23-57 - [i13]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart, Quanlong Wang:
Generalised Supplementarity and new rule for Empty Diagrams to Make the ZX-Calculus More Expressive. CoRR abs/1702.01945 (2017) - [i12]Samson Abramsky, Rui Soares Barbosa, Giovanni Carù, Simon Perdrix:
A complete characterisation of All-versus-Nothing arguments for stabiliser states. CoRR abs/1705.08459 (2017) - [i11]Miriam Backens, Simon Perdrix, Quanlong Wang:
Towards a Minimal Stabilizer ZX-calculus. CoRR abs/1709.08903 (2017) - 2016
- [c30]Simon Perdrix, Quanlong Wang:
Supplementarity is Necessary for Quantum Diagram Reasoning. MFCS 2016: 76:1-76:14 - [c29]Pablo Arrighi, Simon Martiel, Simon Perdrix:
Reversible Causal Graph Dynamics. RC 2016: 73-88 - [c28]Miriam Backens, Simon Perdrix, Quanlong Wang:
A Simplified Stabilizer ZX-calculus. QPL 2016: 1-20 - [i10]Peter Høyer, Mehdi Mhalla, Simon Perdrix:
Contextuality in multipartie pseudo-telepathy graph games. CoRR abs/1609.09689 (2016) - 2015
- [j6]Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
On weak odd domination and graph-based quantum secret sharing. Theor. Comput. Sci. 598: 129-137 (2015) - [c27]Pablo Arrighi, Simon Martiel, Simon Perdrix:
Block Representation of Reversible Causal Graph Dynamics. FCT 2015: 351-363 - [c26]David Cattanéo, Simon Perdrix:
Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms. ISAAC 2015: 259-270 - [c25]Nidhal Hamrit, Simon Perdrix:
Reversibility in Extended Measurement-Based Quantum Computation. RC 2015: 129-138 - [c24]Stefano Facchini, Simon Perdrix:
Quantum Circuits for the Unitary Permutation Problem. TAMC 2015: 324-331 - [i9]Pablo Arrighi, Simon Martiel, Simon Perdrix:
Reversible Causal Graph Dynamics. CoRR abs/1502.04368 (2015) - [i8]Nidhal Hamrit, Simon Perdrix:
Reversibility in the Extended Measurement-based Quantum Computation. CoRR abs/1503.03008 (2015) - [i7]David Cattanéo, Simon Perdrix:
Minimum Degree up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms. CoRR abs/1503.04702 (2015) - 2014
- [j5]Ali Assaf, Alejandro Díaz-Caro, Simon Perdrix, Christine Tasson, Benoît Valiron:
Call-by-value, call-by-name and the vectorial behaviour of the algebraic λ-calculus. Log. Methods Comput. Sci. 10(4) (2014) - [c23]David Cattanéo, Simon Perdrix:
The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes. TAMC 2014: 86-103 - 2013
- [j4]Mehdi Mhalla, Simon Perdrix:
Graph States, Pivot Minor, and Universality of (X, Z)-Measurements. Int. J. Unconv. Comput. 9(1-2): 153-171 (2013) - [c22]David Cattanéo, Simon Perdrix:
Parameterized Complexity of Weak Odd Domination Problems. FCT 2013: 107-120 - [c21]Anne Marin, Damian Markham, Simon Perdrix:
Access Structure in Graphs in High Dimension and Application to Secret Sharing. TQC 2013: 308-324 - [c20]Ross Duncan, Simon Perdrix:
Pivoting makes the ZX-calculus complete for real stabilizers. QPL 2013: 50-62 - 2012
- [c19]Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
Quantum Secret Sharing with Graph States. MEMICS 2012: 15-31 - [c18]Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
New Protocols and Lower Bounds for Quantum Secret Sharing with Graph States. TQC 2012: 1-12 - [c17]Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
On the Minimum Degree Up to Local Complementation: Bounds and Complexity. WG 2012: 138-147 - [i6]Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
On the Minimum Degree up to Local Complementation: Bounds and Complexity. CoRR abs/1204.4564 (2012) - [i5]David Cattanéo, Simon Perdrix:
Parametrized Complexity of Weak Odd Domination Problems. CoRR abs/1206.4081 (2012) - [i4]David Cattanéo, Simon Perdrix:
The Parameterized Complexity of Domination-type Problems and Application to Linear Codes. CoRR abs/1209.5267 (2012) - 2011
- [j3]Simon Perdrix:
Towards Observable Quantum Turing Machines: Fundamentals, Computational Power, and Universality. Int. J. Unconv. Comput. 7(4): 291-311 (2011) - [c16]Mehdi Mhalla, Mio Murao, Simon Perdrix, Masato Someya, Peter S. Turner:
Which Graph States are Useful for Quantum Information Processing? TQC 2011: 174-187 - [c15]Ali Assaf, Simon Perdrix:
Completeness of algebraic CPS simulations. DCM 2011: 16-27 - [i3]Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
Optimal accessing and non-accessing structures for graph protocols. CoRR abs/1109.6181 (2011) - [i2]Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
On Weak Odd Domination and Graph-based Quantum Secret Sharing. CoRR abs/1112.2495 (2011) - 2010
- [j2]Bob Coecke, Simon Perdrix:
Environment and classical channels in categorical quantum mechanics. Log. Methods Comput. Sci. 8(4) (2010) - [c14]Bob Coecke, Simon Perdrix:
Environment and Classical Channels in Categorical Quantum Mechanics. CSL 2010: 230-244 - [c13]Ross Duncan, Simon Perdrix:
Rewriting Measurement-Based Quantum Computations with Generalised Flow. ICALP (2) 2010: 285-296 - [c12]Dan E. Browne, Elham Kashefi, Simon Perdrix:
Computational Depth Complexity of Measurement-Based Quantum Computation. TQC 2010: 35-46
2000 – 2009
- 2009
- [c11]Ross Duncan, Simon Perdrix:
Graph States and the Necessity of Euler Decomposition. CiE 2009: 167-177 - [c10]Elham Kashefi, Damian Markham, Mehdi Mhalla, Simon Perdrix:
Information Flow in Secret Sharing Protocols. DCM 2009: 87-97 - 2008
- [c9]Mehdi Mhalla, Simon Perdrix:
Finding Optimal Flows Efficiently. ICALP (1) 2008: 857-868 - [c8]Simon Perdrix:
Quantum Entanglement Analysis Based on Abstract Interpretation. SAS 2008: 270-282 - [c7]Simon Perdrix:
Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition. QPL/DCM@ICALP 2008: 99-111 - [c6]Bob Coecke, Simon Perdrix, Éric Oliver Paquette:
Bases in Diagrammatic Quantum Protocols. MFPS 2008: 131-152 - [i1]Simon Perdrix:
Quantum entanglement analysis based on abstract interpretation. CoRR abs/0801.4230 (2008) - 2007
- [c5]Simon Perdrix:
A Hierarchy of Quantum Semantics. DCM@ICALP 2007: 71-83 - 2006
- [b1]Simon Perdrix:
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). Grenoble Institute of Technology, France, 2006 - [j1]Simon Perdrix, Philippe Jorrand:
Classically controlled quantum computation. Math. Struct. Comput. Sci. 16(4): 601-620 (2006) - [c4]Peter Høyer, Mehdi Mhalla, Simon Perdrix:
Resources Required for Preparing Graph States. ISAAC 2006: 638-649 - [c3]Philippe Jorrand, Simon Perdrix:
Towards a Quantum Calculus: (Work in Progress, Extended Abstract). QPL 2006: 75-83 - 2005
- [c2]Simon Perdrix, Philippe Jorrand:
Classically-controlled Quantum Computation. DCM@ICALP 2005: 119-128 - [c1]Simon Perdrix:
Quantum Patterns and Types for Entanglement and Separability. QPL 2005: 125-138
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
