Separability Of Pure N-Qubit States: Two Characterizations. - Philippe Jorrand; Mehdi Mhalla (Int. J. Found. Comput. Sci., 2003)

On a modular domination game. - Sylvain Gravier; Mehdi Mhalla; Eric Tannier (Theor. Comput. Sci., 2003)

Around Wythoff's game. - Éric Duchêne; Sylvain Gravier; Mehdi Mhalla (Electron. Notes Discret. Math., 2005)

Resources Required for Preparing Graph States. - Peter Høyer; Mehdi Mhalla; Simon Perdrix (ISAAC, 2006)

Quantum Octal Games. - Sylvain Gravier; Philippe Jorrand; Mehdi Mhalla; Charles Payan (Int. J. Found. Comput. Sci., 2006)

Quantum Query Complexity of Some Graph Problems. - Christoph Dürr; Mark Heiligman; Peter Høyer; Mehdi Mhalla (SIAM J. Comput., 2006)

Finding Optimal Flows Efficiently. - Mehdi Mhalla; Simon Perdrix (ICALP (1), 2008)

Combinatorial graph games. - Éric Duchêne; Sylvain Gravier; Mehdi Mhalla (Ars Comb., 2009)

Information Flow in Secret Sharing Protocols. - Elham Kashefi; Damian Markham; Mehdi Mhalla; Simon Perdrix (DCM, 2009)

Which Graph States are Useful for Quantum Information Processing? - Mehdi Mhalla; Mio Murao; Simon Perdrix; Masato Someya; Peter S. Turner (TQC, 2011)

Optimal accessing and non-accessing structures for graph protocols - Sylvain Gravier; Jérôme Javelle; Mehdi Mhalla; Simon Perdrix (CoRR, 2011)

Quantum Secret Sharing with Graph States. - Sylvain Gravier; Jérôme Javelle; Mehdi Mhalla; Simon Perdrix (MEMICS, 2012)

New Protocols and Lower Bounds for Quantum Secret Sharing with Graph States. - Jérôme Javelle; Mehdi Mhalla; Simon Perdrix (TQC, 2012)

On the Minimum Degree Up to Local Complementation: Bounds and Complexity. - Jérôme Javelle; Mehdi Mhalla; Simon Perdrix (WG, 2012)

Gardner's Minichess Variant is Solved. - Mehdi Mhalla; Frédéric Prost (J. Int. Comput. Games Assoc., 2013)

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

Pseudo-telepathy games and genuine ns k-way nonlocality using graph states. - Anurag Anshu; Mehdi Mhalla (Quantum Inf. Comput., 2013)

On weak odd domination and graph-based quantum secret sharing. - Sylvain Gravier; Jérôme Javelle; Mehdi Mhalla; Simon Perdrix (Theor. Comput. Sci., 2015)

Contextuality in multipartie pseudo-telepathy graph games. - Peter Høyer; Mehdi Mhalla; Simon Perdrix (CoRR, 2016)

Quantum Combinatorial Games. - Paul Dorbec; Mehdi Mhalla (QPL, 2017)

Purely Quantum Polar Codes. - Frédéric Dupuis; Ashutosh Goswami; Mehdi Mhalla; Valentin Savin (ITW, 2019)

Trimming Decoding of Color Codes over the Quantum Erasure Channel. - Sangjun Lee; Mehdi Mhalla; Valentin Savin (ISIT, 2020)

Contextuality and Expressivity of Non-locality. - Sacha Huriot-Tattegrain; Mehdi Mhalla (QPL, 2020)

Contextuality in multipartite pseudo-telepathy graph games. - Anurag Anshu; Peter Høyer; Mehdi Mhalla; Simon Perdrix (J. Comput. Syst. Sci., 2020)

How Quantum Information Can Improve Social Welfare. - Berry Groisman; Michael Mc Gettrick; Mehdi Mhalla; Marcin Pawlowski 002 (IEEE J. Sel. Areas Inf. Theory, 2020)

Communication through coherent control of quantum channels. - Alastair A. Abbott; Julian Wechs; Dominic Horsman; Mehdi Mhalla; Cyril Branciard (Quantum, 2020)

Quantum Polarization of Qudit Channels. - Ashutosh Goswami; Mehdi Mhalla; Valentin Savin (ISIT, 2021)

Coherent Control and Distinguishability of Quantum Channels via PBS-Diagrams. - Cyril Branciard; Alexandre Clément; Mehdi Mhalla; Simon Perdrix (MFCS, 2021)

A Superposition-Based Calculus for Diagrammatic Reasoning. - Rachid Echahed; Mnacho Echenim; Mehdi Mhalla; Nicolas Peltier (PPDP, 2021)

Quantum projective measurements and the CHSH inequality in Isabelle/HOL. - Mnacho Echenim; Mehdi Mhalla (CoRR, 2021)

A Superposition-Based Calculus for Quantum Diagrammatic Reasoning and Beyond. - Rachid Echahed; Mnacho Echenim; Mehdi Mhalla; Nicolas Peltier (CoRR, 2021)

Multilevel polarization for quantum Channels. - Ashutosh Goswami; Mehdi Mhalla; Valentin Savin (Quantum Inf. Comput., 2021)

Polarization of Quantum Channels Using Clifford-Based Channel Combining. - Frédéric Dupuis; Ashutosh Goswami; Mehdi Mhalla; Valentin Savin (IEEE Trans. Inf. Theory, 2021)

Stabilizer Inactivation for Message-Passing Decoding of Quantum LDPC Codes. - Julien du Crest; Mehdi Mhalla; Valentin Savin (ITW, 2022)

Fault-Tolerant Preparation of Quantum Polar Codes Encoding One Logical Qubit. - Ashutosh Goswami; Mehdi Mhalla; Valentin Savin (CoRR, 2022)

A Strict Constrained Superposition Calculus for Graphs. - Rachid Echahed; Mnacho Echenim; Mehdi Mhalla; Nicolas Peltier (FoSSaCS, 2023)

Layered Decoding of Quantum LDPC Codes. - Julien du Crest; Francisco Garcia-Herrero; Mehdi Mhalla; Valentin Savin; Javier Valls (ISTC, 2023)

Improved Rate Fault-Tolerant Preparation of Q1 Code-States. - Ashutosh Goswami; Mehdi Mhalla; Valentin Savin (ISTC, 2023)

The CHSH inequality: Tsirelson's upper-bound and other results. - Mnacho Echenim; Mehdi Mhalla; Coraline Mori (Arch. Formal Proofs, 2023)

Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems. - Maxime Cautrès; Nathan Claudet; Mehdi Mhalla; Simon Perdrix; Valentin Savin; Stéphan Thomassé (ICALP, 2024)

Improving social welfare in non-cooperative games with different types of quantum resources. - Alastair A. Abbott; Mehdi Mhalla; Pierre Pocreau (Quantum, 2024)

Check-Agnosia based Post-Processor for Message-Passing Decoding of Quantum LDPC Codes. - Julien du Crest; Francisco Garcia-Herrero; Mehdi Mhalla; Valentin Savin; Javier Valls (Quantum, 2024)

Smash and grab: The 0 ⋅ 6 scoring game on graphs. - Éric Duchêne; Valentin Gledel; Sylvain Gravier; Fionn Mc Inerney; Mehdi Mhalla; Aline Parreau (Theor. Comput. Sci., 2024)

A Formalization of the CHSH Inequality and Tsirelson's Upper-bound in Isabelle/HOL. - Mnacho Echenim; Mehdi Mhalla (J. Autom. Reason., 2024)

A Blindness Property of the Min-Sum Decoding for the Toric Code. - Julien du Crest; Mehdi Mhalla; Valentin Savin (IEEE J. Sel. Areas Inf. Theory, 2025)