Number of documents

56

Simon Perdrix PhD


I am a CNRS researcher at LORIAInria Project Team CARTE. My research area is Quantum Computing and related topics.


Journal articles10 documents

  • Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix. On weak odd domination and graph-based quantum secret sharing. Theoretical Computer Science, Elsevier, 2015. ⟨hal-02004253⟩
  • Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix. On weak odd domination and graph-based quantum secret sharing. Theoretical Computer Science, Elsevier, 2015, 598, ⟨10.1016/j.tcs.2015.05.038⟩. ⟨hal-01249271⟩
  • Pablo Arrighi, Simon Perdrix. L’ordinateur quantique pour simuler... la physique quantique. La Recherche : l'actualité des sciences, société d'éditions scientifiques, 2015. ⟨hal-01260370⟩
  • 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. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2014, 10:4 (8), pp.40. ⟨http://lmcs-online.org/ojs/viewarticle.php?id=1567⟩. ⟨10.2168/LMCS-10(4:8)2014⟩. ⟨hal-01097602⟩
  • Mehdi Mhalla, Simon Perdrix. Graph States, Pivot Minor, and Universality of (X,Z)-measurements. International Journal of Unconventional Computing, Old City Publishing, 2013, 9 (1-2), pp.153-171. ⟨hal-00934104⟩
  • Simon Perdrix. Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition. Electronic Notes in Theoretical Computer Science, Elsevier, 2011, 270 (1), pp.99-111. ⟨10.1016/j.entcs.2011.01.009⟩. ⟨hal-00931367⟩
  • Simon Perdrix. Towards Observable Quantum Turing Machines: Fundamentals, Computational Power, and Universality. International Journal of Unconventional Computing, Old City Publishing, 2011, 7 (4), pp.291-311. ⟨hal-00931402⟩
  • Bob Coecke, Simon Perdrix. Environment and classical channels in categorical quantum mechanics. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2010, 8 (4), pp.230--244. ⟨hal-00940885⟩
  • Simon Perdrix, Philippe Jorrand. Classically controlled quantum computation. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2006, 16 (04), ⟨10.1017/S096012950600538X⟩. ⟨hal-01378709⟩
  • Simon Perdrix, Philippe Jorrand. Classically-Controlled Quantum Computation. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2006, 16, pp.601-620. ⟨hal-00130305⟩

Conference papers32 documents

  • Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart. Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics. The 33rd Annual Symposium on Logic in Computer Science, Jul 2018, Oxford, United Kingdom. pp.569--578, ⟨10.1145/3209108.3209139⟩. ⟨hal-01716501⟩
  • Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart. A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics. The 33rd Annual Symposium on Logic in Computer Science, 2018, Jul 2018, Oxford, United Kingdom. pp.559--568, ⟨10.1145/3209108.3209131⟩. ⟨hal-01529623v2⟩
  • Anurag Anshu, Peter Hoyer, Mehdi Mhalla, Simon Perdrix. Contextuality in multipartie pseudo-telepathy graph games. FCT’17- 21st International Symposium on Fundamentals of Computation Theory, Sep 2017, Bordeaux, France. pp.41-55, ⟨10.1007/978-3-662-55751-8_5⟩. ⟨hal-01378413⟩
  • Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart. Y-Calculus: A language for real Matrices derived from the ZX-Calculus. International Conference on Quantum Physics and Logics (QPL), 2017, Nijmegen, Netherlands. ⟨hal-01445948⟩
  • Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart, Quanlong Wang. ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T quantum mechanics. MFCS 2017 - 42nd International Symposium on Mathematical Foundations of Computer Science, Aug 2017, Aalborg, Denmark. pp.15. ⟨hal-01445707v2⟩
  • Sansom Abramski, Rui Soares Barbosa, Giovanni Carù, Simon Perdrix. A complete characterisation of All-versus-Nothing arguments for stabiliser states. 14th International Conference on Quantum Physics and Logic (QPL), Jul 2017, Nijmegen, Netherlands. ⟨hal-01653557⟩
  • Simon Perdrix, Luc Sanselme. Determinism and Computational Power of Real Measurement-based Quantum Computation. FCT'17- 21st International Symposium on Fundamentals of Computation Theory, Sep 2017, Bordeaux, France. ⟨10.1007/978-3-662-55751-8_31⟩. ⟨hal-01377339v2⟩
  • Miriam Backens, Simon Perdrix, Quanlong Wang. A Simplified Stabilizer ZX-calculus. 13th International Conference on Quantum Physics and Logic , Jun 2016, Glasgow, United Kingdom. ⟨hal-01404591⟩
  • Stefano Facchini, Simon Perdrix. Quantum Circuits for the Unitary Permutation Problem. TAMC 2015, May 2015, Singapore, Singapore. pp.324-331, ⟨10.1007/978-3-319-17142-5_28⟩. ⟨hal-00994182⟩
  • Simon Perdrix, Quanlong Wang. The ZX Calculus is incomplete for Clifford+T quantum mechanics. Quantum Theory: from foundations to technologies – QTFT, Jun 2015, Vaxjo, Sweden. ⟨hal-01249274⟩
  • Pablo Arrighi, Simon Martiel, Simon Perdrix. Block Representation of Reversible Causal Graph Dynamics. 20th International Symposium on Fundamentals of Computation Theory, Aug 2015, Gdańsk, Poland. pp.14, ⟨10.1007/978-3-319-22177-9_27⟩. ⟨hal-01249272⟩
  • Nidhal Hamrit, Simon Perdrix. Reversibility in Extended Measurement-based Quantum Computation. 7th Conference on Reversible Computation, Jul 2015, Grenoble, France. pp.10, ⟨10.1007/978-3-319-20860-2_8⟩. ⟨hal-01132861⟩
  • David Cattanéo, Simon Perdrix. Minimum Degree up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms. 26th International Symposium on Algorithms and Computation (ISAAC 2015), Dec 2015, Nagoya, Japan. pp.12, ⟨10.1007/978-3-662-48971-0_23⟩. ⟨hal-01132843⟩
  • David Cattanéo, Simon Perdrix. The Parameterized Complexity of Domination-type Problems and Application to Linear Codes. Theory and Applications of Models of Computation, Apr 2014, Chennai, India. pp.86-103, ⟨10.1007/978-3-319-06089-7_7⟩. ⟨hal-00944653⟩
  • David Cattanéo, Simon Perdrix. Parameterized Complexity of Weak Odd Domination Problems. 19th International Symposium on Fundamentals of Computation Theory, Aug 2013, Liverpool, United Kingdom. pp.107-120, ⟨10.1007/978-3-642-40164-0_13⟩. ⟨hal-00944652⟩
  • Ross Duncan, Simon Perdrix. Pivoting Makes the ZX-Calculus Complete for Real Stabilizers. QPL 2013 - 10th Workshop on Quantum Physics and Logic, Jul 2013, Castelldefels, Barcelona, Spain. ⟨hal-00935185⟩
  • Anne Marin, Damian Markham, Simon Perdrix. Access Structure in Graphs in High Dimension and Application to Secret Sharing. TQC 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⟩. ⟨hal-00935108⟩
  • Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix. Quantum Secret Sharing with Graph States. MEMICS 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⟩. ⟨hal-00933722⟩
  • Jérôme Javelle, Mehdi Mhalla, Simon Perdrix. On the Minimum Degree up to Local Complementation: Bounds and Complexity. WG 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⟩. ⟨hal-00933720⟩
  • Jérôme Javelle, Mehdi Mhalla, Simon Perdrix. New Protocols and Lower Bounds for Quantum Secret Sharing with Graph States. TQC 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⟩. ⟨hal-00934531⟩
  • Ali Assaf, Simon Perdrix. Completeness of algebraic CPS simulations. DCM 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⟩. ⟨hal-00932770⟩
  • Mehdi Mhalla, Mio Murao, Simon Perdrix, Masato Someya, Peter S. Turner. 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. ⟨hal-00932374⟩
  • Alejandro Díaz-Caro, Simon Perdrix, Christine Tasson, Benoît Valiron. Equivalence of algebraic λ-calculi. HOR - 5th International Workshop on Higher-Order Rewriting - 2010, Eduardo Bonelli, Jul 2010, Edinburgh, United Kingdom. pp.6-11. ⟨hal-00924912⟩
  • Ross Duncan, Simon Perdrix. Rewriting Measurement-Based Quantum Computations with Generalised Flow. ICALP, 2010, Bordeaux, France. pp.285-296. ⟨hal-00940895⟩
  • Bob Coecke, Simon Perdrix. Environment and Classical Channels in Categorical Quantum Mechanics. CSL, 2010, Czech Republic. pp.230-244. ⟨hal-00940890⟩
  • Dan E. Browne, Elham Kashefi, Simon Perdrix. Computational Depth Complexity of Measurement-Based Quantum Computation. TQC 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⟩. ⟨hal-00932720⟩
  • Ross Duncan, Simon Perdrix. Graph States and the Necessity of Euler Decomposition. 5th Conference on Computability in Europe, 2009, Heidelberg, Germany. pp.167-177. ⟨hal-00940879⟩
  • Elham Kashefi, Damian Markham, Mehdi Mhalla, Simon Perdrix. Information Flow in Secret Sharing Protocols. DCM, 2009, Rhodes, Greece. pp.87-97. ⟨hal-00940873⟩
  • Simon Perdrix. Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition. Joint 5th QPL and 4th DCM 2008, 2008, Oxford, United Kingdom. pp.99 - 111, ⟨10.1016/j.entcs.2011.01.009⟩. ⟨hal-01378693⟩
  • Peter Høyer, Mehdi Mhalla, Simon Perdrix. Resources Required for Preparing Graph States. 17th International Symposium on Algorithms and Computation (ISAAC 2006), Dec 2006, Kolkata, India. pp.638 - 649, ⟨10.1007/11940128_64⟩. ⟨hal-01378771⟩
  • Simon Perdrix, Philippe Jorrand. Classically-controlled Quantum Computation. DCM'05, 2005, Lisbon, Portugal. pp.119 - 128, ⟨10.1016/j.entcs.2005.09.026⟩. ⟨hal-01378754⟩
  • Philippe Jorrand, Simon Perdrix. Unifying Quantum Computation with Projective Measurements only and One-Way Quantum Computation. Quantum Informatics 2004, Jan 2004, Moscow, Russia. ⟨10.1117/12.620302⟩. ⟨hal-01378676⟩

Book sections5 documents

  • Pablo Arrighi, Simon Perdrix. Modèles de calcul quantiques. Étienne BAUDRIER Lo\"ic MAZO. Informatique Mathématique - une photographie en 2016, CNRS Editions, 2016. ⟨hal-01467253⟩
  • Philippe Jorrand, Simon Perdrix. Abstract interpretation techniques in quantum computation. Simon Gay and Ian Mackie. Semantic Techniques in Quantum Computation, Cambridge University Press, pp.206, 2010. ⟨hal-00941288⟩
  • Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, et al.. Décidabilité et Complexité. Pierre Marquis, Odile Papini and Henri Prade. IA Handbook, Cépaduès, pp.1-63, 2010. 〈inria-00549416〉
  • Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, et al.. Décidabilité et Complexité. IA Handbook, Cépaduès, pp.1-63, 2010. ⟨hal-00999661⟩
  • Vincent Danos, Elham Kashefi, Prakash Panangaden, Simon Perdrix. Extended Measurement Calculus. Semantic Techniques in Quantum Computation, Cambridge University Press, pp.235, 2009. ⟨hal-00999645⟩

Preprints, Working Papers, ...8 documents

  • Titouan Carette, Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart. Completeness of Graphical Languages for Mixed States Quantum Mechanics. 2019. ⟨hal-02025720⟩
  • Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart. A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness. 2018. ⟨hal-01791791⟩
  • Miriam Backens, Simon Perdrix, Quanlong Wang. Towards a Minimal Stabilizer ZX-calculus. 2017. ⟨hal-01597114⟩
  • Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix. On Weak Odd Domination and Graph-based Quantum Secret Sharing. 2012. ⟨hal-00944428⟩
  • Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix. Optimal accessing and non-accessing structures for graph protocols. 2011. ⟨hal-00944430⟩
  • Simon Perdrix, Philippe Jorrand. Measurement-Based Quantum Turing Machines and their Universality. 2004. ⟨hal-00130304⟩
  • Simon Perdrix, Philippe Jorrand. Measurement-Based Quantum Turing Machines and Questions of Universalities. 2004. ⟨hal-00130303⟩
  • Mehdi Mhalla, Simon Perdrix. Complexity of Graph State Preparation. 2004. ⟨hal-01378761⟩

Theses1 document

  • Simon Perdrix. Modèles formels du calcul quantique : ressources, machines abstraites et calcul par mesure. Informatique [cs]. Institut National Polytechnique de Grenoble - INPG, 2006. Français. ⟨tel-00275323⟩