Simon Perdrix
Présentation
I am an Inria senior researcher (DR1) at LORIA, Inria Project Team Mocqua. My research area is Quantum Computing and related topics.
Publications
Publications
|
|
Diagrammatic Reasoning with Control as a Constructor, Applications to Quantum Circuits29th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), 2026, Turin, Italy |
|
|
Local equivalence of stabilizer states: a graphical characterisationSTACS: 42nd International Symposium on Theoretical Aspects of Computer Science, Mar 2025, Jena, Germany |
|
|
Deciding Local Unitary Equivalence of Graph States in Quasi-Polynomial Time52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), Jul 2025, Aarhus (Danemark), Denmark. pp.59:1-59:20, ⟨10.4230/LIPIcs.ICALP.2025.59⟩ |
|
|
Quantum Graph States: Bridging Classical Theory and Quantum Innovation, Workshop SummaryBridging Classical Theory and Quantum Innovation, May 2025, Washinghton DC, United States |
|
|
Quantum Circuit Completeness: Extensions and SimplificationsInternational Conference on Computer Science Logic CSL 2024, Feb 2024, Naples, Italy. ⟨10.4230/LIPIcs.CSL.2024.20⟩ |
|
|
On the Hardness of Analyzing Quantum Programs QuantitativelyESOP 2024 - 33rd European Symposium on Programming, Apr 2024, Luxembourg, Luxembourg. pp.28, ⟨10.1007/978-3-031-57267-8_2⟩ |
|
|
Vertex-Minor Universal Graphs for Generating Entangled Quantum SubsystemsICALP 2024 51st EATCS International Colloquium on Automata, Languages and Programming, European Association for Theoretical Computer Science (EATCS), Jul 2024, Tallinn, Estonia. ⟨10.4230/LIPIcs.ICALP.2024.36⟩ |
|
|
Minimal Equational Theories for Quantum CircuitsLICS '24: 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2024, Tallinn, Estonia. pp.1-14, ⟨10.1145/3661814.3662088⟩ |
|
|
Covering a Graph with Minimal Local SetsWG 2024: 50th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2024, Gozd Martuljek, Slovenia |
A Complete Equational Theory for Quantum Circuits18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023), Jul 2023, Aveiro, Portugal |
|
Optimal Hadamard gate count for Clifford+T synthesis of Pauli rotations sequencesTQC 2023: 18th Theory of Quantum Computation, Communication and Cryptography, Jul 2023, Aveiro, Portugal |
|
|
|
A Complete Equational Theory for Quantum Circuits2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2023, Boston, United States. pp.1-13, ⟨10.1109/LICS56636.2023.10175801⟩ |
|
|
Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehiclesROADEF 2022 - 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France |
|
|
LO_v-Calculus: A Graphical Language for Linear Optical Quantum CircuitsMFCS 2022 - 47th International Symposium on Mathematical Foundations of Computer Science, Aug 2022, Vienna, Austria. pp.35:1--35:16, ⟨10.4230/LIPIcs.MFCS.2022.35⟩ |
|
|
Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-CalculusMFCS 2022 - 47th International Symposium on Mathematical Foundations of Computer Science, Aug 2022, Vienne, Austria. ⟨10.4230/LIPIcs.MFCS.2022.36⟩ |
|
|
Quantum Expectation Transformers for Cost AnalysisSymposium on Logic In Computer Science LICS ’22, Aug 2022, Haifa, Israel |
Addition and Differentiation of ZX-Diagrams7th International Conference on Formal Structures for > Computation and Deduction (FSCD 2022), Aug 2022, Haifa (Israël), France. ⟨10.4230/LIPIcs.FSCD.2022.13⟩ |
|
|
|
Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite MemoryLICS 2021 - 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2021, Rome, Italy |
|
|
Hybrid Quantum-Classical Circuit Simplification with the ZX-CalculusAPLAS 2021 - Asian Symposium on Programming Languages and Systems, Oct 2021, Chicago, United States. pp.121-139, ⟨10.1007/978-3-030-89051-3_8⟩ |
|
|
Coherent Control and Distinguishability of Quantum Channels via PBS-DiagramsMFCS 2021 - 46th International Symposium on Mathematical Foundations of Computer Science, Aug 2021, Tallinn, Estonia. pp.22:1-22:20, ⟨10.4230/LIPIcs.MFCS.2021.22⟩ |
|
|
PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), Aug 2020, Prague, Czech Republic. pp.24:1-24:14, ⟨10.4230/LIPIcs.MFCS.2020.24⟩ |
|
|
Quantum Programming with Inductive Datatypes: Causality and Affine Type TheoryInternational Conference on Foundations of Software Science and Computation Structures, Apr 2020, Dublin, Ireland. pp.562-581, ⟨10.1007/978-3-030-45231-5_29⟩ |
|
|
Pauli Fusion: a computational model to realise quantum transformations from ZX termsQPL'19 : International Conference on Quantum Physics and Logic, Jun 2019, Los Angeles, United States |
|
|
SZX-calculus: Scalable Graphical Quantum ReasoningMFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. pp.55:1--55:15, ⟨10.4230/LIPIcs.MFCS.2019.55⟩ |
|
|
A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle CompletenessLICS 2019 - 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. ⟨10.1109/LICS.2019.8785754⟩ |
|
|
Completeness of Graphical Languages for Mixed States Quantum MechanicsICALP, 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.108⟩ |
|
|
A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum MechanicsThe 33rd Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} 2018, Jul 2018, Oxford, United Kingdom. pp.559--568, ⟨10.1145/3209108.3209131⟩ |
|
|
Diagrammatic Reasoning beyond Clifford+T Quantum MechanicsThe 33rd Annual Symposium on Logic in Computer Science, Jul 2018, Oxford, United Kingdom. pp.569--578, ⟨10.1145/3209108.3209139⟩ |
|
|
Y-Calculus: A language for real Matrices derived from the ZX-CalculusInternational Conference on Quantum Physics and Logics (QPL), 2017, Nijmegen, Netherlands |
|
|
ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T quantum mechanicsMFCS 2017 - 42nd International Symposium on Mathematical Foundations of Computer Science, Aug 2017, Aalborg, Denmark. pp.15 |
|
|
Contextuality in multipartie pseudo-telepathy graph gamesFCT’17- 21st International Symposium on Fundamentals of Computation Theory, Sep 2017, Bordeaux, France. pp.41-55, ⟨10.1007/978-3-662-55751-8_5⟩ |
|
|
Determinism and Computational Power of Real Measurement-based Quantum ComputationFCT'17- 21st International Symposium on Fundamentals of Computation Theory, Sep 2017, Bordeaux, France. ⟨10.1007/978-3-662-55751-8_31⟩ |
A complete characterisation of All-versus-Nothing arguments for stabiliser states14th International Conference on Quantum Physics and Logic (QPL), Jul 2017, Nijmegen, Netherlands |
|
|
|
Reversible Causal Graph DynamicsReversible Computation, Jul 2016, Bologna, Italy. pp.73-88, ⟨10.1007/978-3-319-40578-0_5⟩ |
|
|
Supplementarity is Necessary for Quantum Diagram Reasoning *41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Aug 2016, Krakow, Poland. pp.76:1--76:14, ⟨10.4230/LIPIcs.MFCS.2016.76⟩ |
|
|
A Simplified Stabilizer ZX-calculus13th International Conference on Quantum Physics and Logic , Jun 2016, Glasgow, United Kingdom |
|
|
Reversibility in Extended Measurement-based Quantum Computation7th Conference on Reversible Computation, Jul 2015, Grenoble, France. pp.10, ⟨10.1007/978-3-319-20860-2_8⟩ |
|
|
The ZX Calculus is incomplete for Clifford+T quantum mechanicsQuantum Theory: from foundations to technologies – QTFT, Jun 2015, Vaxjo, Sweden |
|
|
Quantum Circuits for the Unitary Permutation ProblemTAMC 2015, May 2015, Singapore, Singapore. pp.324-331, ⟨10.1007/978-3-319-17142-5_28⟩ |
|
|
Minimum Degree up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms26th International Symposium on Algorithms and Computation (ISAAC 2015), Dec 2015, Nagoya, Japan. pp.12, ⟨10.1007/978-3-662-48971-0_23⟩ |
Block Representation of Reversible Causal Graph Dynamics20th International Symposium on Fundamentals of Computation Theory, Aug 2015, Gdańsk, Poland. pp.14, ⟨10.1007/978-3-319-22177-9_27⟩ |
|
|
|
The Parameterized Complexity of Domination-type Problems and Application to Linear CodesTheory and Applications of Models of Computation, Apr 2014, Chennai, India. pp.86-103, ⟨10.1007/978-3-319-06089-7_7⟩ |
|
|
New Protocols and Lower Bounds for Quantum Secret Sharing with Graph StatesTQC 2012 - 7th Conference on Theory of Quantum Computation, Communication, and Cryptography, May 2012, Tokyo, Japan. pp.1-12, ⟨10.1007/978-3-642-35656-8_1⟩ |
|
|
Parameterized Complexity of Weak Odd Domination Problems19th International Symposium on Fundamentals of Computation Theory, Aug 2013, Liverpool, United Kingdom. pp.107-120, ⟨10.1007/978-3-642-40164-0_13⟩ |
|
|
Access Structure in Graphs in High Dimension and Application to Secret SharingTQC 2013 - 8th Conference on the Theory of Quantum Computation, Communication and Cryptography, May 2013, Guelph, Canada. pp.308-324, ⟨10.4230/LIPIcs.TQC.2013.308⟩ |
|
|
Pivoting Makes the ZX-Calculus Complete for Real StabilizersQPL 2013 - 10th Workshop on Quantum Physics and Logic, Jul 2013, Castelldefels, Barcelona, Spain |
|
|
Quantum Secret Sharing with Graph StatesMEMICS 2012 - International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, Oct 2012, Znojmo, Czech Republic. pp.15-31, ⟨10.1007/978-3-642-36046-6_3⟩ |
|
|
Completeness of algebraic CPS simulationsDCM 2011 - International Workshop on Developments of Computational Methods (satellite event of ICALP 2011), Jul 2011, Zurich, Switzerland. pp.16-27, ⟨10.4204/EPTCS.88.2⟩ |
|
|
On the Minimum Degree up to Local Complementation: Bounds and ComplexityWG 2012 - International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.138-147, ⟨10.1007/978-3-642-34611-8_16⟩ |
|
|
Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness ConditionJoint 5th QPL and 4th DCM 2008, 2008, Oxford, United Kingdom. pp.99 - 111, ⟨10.1016/j.entcs.2011.01.009⟩ |
|
|
Which graph states are useful for quantum information processing?TQC 2011 - Conference on the Theory of Quantum Computation, Communication and Cryptography, May 2011, Madrid, Spain. 13 p |
|
|
Computational Depth Complexity of Measurement-Based Quantum ComputationTQC 2010 - 5th Conference on Theory of Quantum Computation, Communication, and Cryptography, Apr 2010, Leeds, United Kingdom. pp.35-46, ⟨10.1007/978-3-642-18073-6_4⟩ |
Environment and Classical Channels in Categorical Quantum MechanicsCSL, 2010, Czech Republic. pp.230-244 |
|
|
|
Equivalence of algebraic λ-calculiHOR - 5th International Workshop on Higher-Order Rewriting - 2010, Eduardo Bonelli, Jul 2010, Edinburgh, United Kingdom. pp.6-11 |
Rewriting Measurement-Based Quantum Computations with Generalised FlowICALP, 2010, Bordeaux, France. pp.285-296 |
|
Graph States and the Necessity of Euler Decomposition5th Conference on Computability in Europe, 2009, Heidelberg, Germany. pp.167-177 |
|
Information Flow in Secret Sharing ProtocolsDCM, 2009, Rhodes, Greece. pp.87-97 |
|
|
|
Resources Required for Preparing Graph States17th International Symposium on Algorithms and Computation (ISAAC 2006), Dec 2006, Kolkata, India. pp.638 - 649, ⟨10.1007/11940128_64⟩ |
|
|
Classically-controlled Quantum ComputationDCM'05, 2005, Lisbon, Portugal. pp.119 - 128, ⟨10.1016/j.entcs.2005.09.026⟩ |
|
|
Unifying Quantum Computation with Projective Measurements only and One-Way Quantum ComputationQuantum Informatics 2004, Jan 2004, Moscow, Russia. ⟨10.1117/12.620302⟩ |
Theoretical Computer Science: Computability, Decidability and LogicA Guided Tour of Artificial Intelligence Research - Volume III: Interfaces and Applications of Artificial Intelligence (10.1007/978-3-030-06170-8), Springer International Publishing, pp.1-50, 2020, ⟨10.1007/978-3-030-06170-8_1⟩ |
|
Theoretical Computer Science: Computational ComplexityA Guided Tour of Artificial Intelligence Research - Volume III: Interfaces and Applications of Artificial Intelligence (10.1007/978-3-030-06170-8), Springer International Publishing, 2020 |
|
Modèles de calcul quantiquesÉtienne BAUDRIER Lo\"ic MAZO. Informatique Mathématique - une photographie en 2016, CNRS Editions, 2016 |
|
Abstract interpretation techniques in quantum computationSimon Gay and Ian Mackie. Semantic Techniques in Quantum Computation, Cambridge University Press, pp.206, 2010 |
|
Décidabilité et ComplexitéIA Handbook, Cépaduès, pp.1-63, 2010 |
|
|
|
Décidabilité et ComplexitéPierre Marquis, Odile Papini and Henri Prade. IA Handbook, Cépaduès, pp.1-63, 2010 |
Extended Measurement CalculusSemantic Techniques in Quantum Computation, Cambridge University Press, pp.235, 2009 |
|
|
Modèles formels du calcul quantique : ressources, machines abstraites et calcul par mesureInformatique [cs]. Institut National Polytechnique de Grenoble - INPG, 2006. Français. ⟨NNT : ⟩ |
|
|
Approches Graphiques en Informatique QuantiquePhysique Quantique [quant-ph]. Université de Lorraine, 2019 |