Nombre de documents

46

Simon Perdrix PhD


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


Article dans une revue9 documents

  • 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>
  • Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix. On weak odd domination and graph-based quantum secret sharing. Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 598, <10.1016/j.tcs.2015.05.038>. <hal-01249271>
  • 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. 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>
  • 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>
  • 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>

Communication dans un congrès25 documents

  • Miriam Backens, Simon Perdrix, Quanlong Wang. A Simplified Stabilizer ZX-calculus. 13th International Conference on Quantum Physics and Logic , Jun 2016, Glasgow, United Kingdom. 2016, <http://qpl2016.cis.strath.ac.uk/>. <hal-01404591>
  • 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. 9472, pp.12, 2015, Algorithms and Computation (ISAAC'2015). <10.1007/978-3-662-48971-0_23>. <hal-01132843>
  • Nidhal Hamrit, Simon Perdrix. Reversibility in Extended Measurement-based Quantum Computation. 7th Conference on Reversible Computation, Jul 2015, Grenoble, France. 9138, pp.10, 2015, Reversible Computation. <10.1007/978-3-319-20860-2_8>. <hal-01132861>
  • Stefano Facchini, Simon Perdrix. Quantum Circuits for the Unitary Permutation Problem. TAMC 2015, May 2015, Singapore, Singapore. 9076, pp.324-331, 2015, Theory and Applications of Models of Computation. <10.1007/978-3-319-17142-5_28>. <hal-00994182>
  • 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. 9210, pp.14, 2015, Fundamentals of Computation Theory. <10.1007/978-3-319-22177-9_27>. <hal-01249272>
  • 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>
  • 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. 8402, pp.86-103, Lecture Notes in Computer Science. <http://link.springer.com/chapter/10.1007%2F978-3-319-06089-7_7>. <10.1007/978-3-319-06089-7_7>. <hal-00944653>
  • 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. 2013. <hal-00935185>
  • Anne Marin, Damian Markham, Simon Perdrix. Access Structure in Graphs in High Dimension and Application to Secret Sharing. Simone Severini and Fernando Brandao. TQC 2013 - 8th Conference on the Theory of Quantum Computation, Communication and Cryptography, May 2013, Guelph, Canada. Schloss Dagstuhl, 22, pp.308-324, 2013, Leibniz International Proceedings in Informatics (LIPIcs). <10.4230/LIPIcs.TQC.2013.308>. <hal-00935108>
  • 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. 8070, pp.107-120, 2013, Lecture Notes in Computer Science. <10.1007/978-3-642-40164-0_13>. <hal-00944652>
  • Jérôme Javelle, Mehdi Mhalla, Simon Perdrix. New Protocols and Lower Bounds for Quantum Secret Sharing with Graph States. Kazuo Iwama, Yasuhito Kawano, Mio Murao. TQC 2012 - 7th Conference on Theory of Quantum Computation, Communication, and Cryptography, May 2012, Tokyo, Japan. Springer, 7582, pp.1-12, 2013, Lecture Notes in Computer Science (LNCS). <10.1007/978-3-642-35656-8_1>. <hal-00934531>
  • Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix. Quantum Secret Sharing with Graph States. Antonín Kučera, Thomas A. Henzinger, Jaroslav Nešetřil, Tomáš Vojnar, David Antoš. MEMICS 2012 - International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, Oct 2012, Znojmo, Czech Republic. Springer, 7721, pp.15-31, 2013, Lecture Notes in Computer Science (LNCS). <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. Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern. WG 2012 - International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2012, Jerusalem, Israel. Springer, 7551, pp.138-147, 2012, Lecture Notes in Computer Science (LNCS). <10.1007/978-3-642-34611-8_16>. <hal-00933720>
  • Ali Assaf, Simon Perdrix. Completeness of algebraic CPS simulations. Elham Kashefi, Jean Krivine, Femke van Raamsdonk. DCM 2011 - International Workshop on Developments of Computational Methods (satellite event of ICALP 2011), Jul 2011, Zurich, Switzerland. 88, pp.16-27, 2012, Electronic Proceedings in Theoretical Computer Science (EPTCS). <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., 2011. <hal-00932374>
  • Dan E. Browne, Elham Kashefi, Simon Perdrix. Computational Depth Complexity of Measurement-Based Quantum Computation. Wim van Dam, Vivien M. Kendon, Simone Severini. TQC 2010 - 5th Conference on Theory of Quantum Computation, Communication, and Cryptography, Apr 2010, Leeds, United Kingdom. Springer, 6519, pp.35-46, 2011, Lecture Notes in Computer Science (LNCS). <10.1007/978-3-642-18073-6_4>. <hal-00932720>
  • Alejandro Díaz-Caro, Simon Perdrix, Christine Tasson, Benoît Valiron. Equivalence of algebraic λ-calculi. HOR - 5th International Workshop on Higher-Order Rewriting - 2010, Jul 2010, Edinburgh, United Kingdom. pp.6-11, 2010. <hal-00924912>
  • Bob Coecke, Simon Perdrix. Environment and Classical Channels in Categorical Quantum Mechanics. Dawar, Anuj and Veith, Helmut. CSL, 2010, Czech Republic. Springer Berlin Heidelberg, 6247, pp.230-244, 2010, Lecture Notes in Computer Science. <hal-00940890>
  • Ross Duncan, Simon Perdrix. Rewriting Measurement-Based Quantum Computations with Generalised Flow. Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide and Paul G. Spirakis. ICALP, 2010, Bordeaux, France. Springer Berlin Heidelberg, 6199, pp.285-296, 2010, Lecture Notes in Computer Science. <hal-00940895>
  • Elham Kashefi, Damian Markham, Mehdi Mhalla, Simon Perdrix. Information Flow in Secret Sharing Protocols. S. Barry Cooper and Vincent Danos. DCM, 2009, Rhodes, Greece. pp.87-97, 2009, EPTCS. <hal-00940873>
  • Ross Duncan, Simon Perdrix. Graph States and the Necessity of Euler Decomposition. Ambos-Spies, Klaus and Löwe, Benedikt and Merkle, Wolfgang. 5th Conference on Computability in Europe, 2009, Heidelberg, Germany. Springer Berlin Heidelberg, 5635, pp.167-177, 2009, Lecture Notes in Computer Science. <hal-00940879>
  • 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. Electronic Notes in Theoretical Computer Science, 270, pp.99 - 111, 2011, <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. Algorithms and Computation 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006. Proceedings, 4288, pp.638 - 649, 2006, Lecture Notes in Computer Science. <10.1007/11940128_64>. <hal-01378771>
  • Simon Perdrix, Philippe Jorrand. Classically-controlled Quantum Computation. DCM'05, 2005, Lisbon, Portugal. 135 (3), pp.119 - 128, Electronic Notes in Theoretical Computer Science. <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. 2004, <10.1117/12.620302>. <hal-01378676>

Chapitre d'ouvrage4 documents

  • 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>
  • 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>
  • Vincent Danos, Elham Kashefi, Prakash Panangaden, Simon Perdrix. Extended Measurement Calculus. Semantic Techniques in Quantum Computation, Cambridge University Press, pp.235, 2009. <hal-00999645>

Pré-publication, Document de travail7 documents

  • Peter Hoyer, Mehdi Mhalla, Simon Perdrix. Contextuality in multipartie pseudo-telepathy graph games. 2016. <hal-01378413>
  • Simon Perdrix, Luc Sanselme. Determinism and Computational Power of Real Measurement-based Quantum Computation. 2016. <hal-01377339>
  • Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix. On Weak Odd Domination and Graph-based Quantum Secret Sharing. IF_PREPUB. Subsumes arXiv:1109.6181: Optimal accessing and non-accessing structures for graph protocols. 2012. <hal-00944428>
  • Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix. Optimal accessing and non-accessing structures for graph protocols. IF_PREPUB. 2011. <hal-00944430>
  • Simon Perdrix, Philippe Jorrand. Measurement-Based Quantum Turing Machines and their Universality. 13 pages, based upon quant-ph/0402156 with significant improvements. 2004. <hal-00130304>
  • Simon Perdrix, Philippe Jorrand. Measurement-Based Quantum Turing Machines and Questions of Universalities. 12 pages, 9 figures. 2004. <hal-00130303>
  • Mehdi Mhalla, Simon Perdrix. Complexity of Graph State Preparation. 17 pages. 2004. <hal-01378761>

Thèse1 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>