Quantum query complexity of some graph problems C Dürr, M Heiligman, P HOyer, M Mhalla SIAM Journal on Computing 35 (6), 1310-1328, 2006 | 199 | 2006 |

Generalized flow and determinism in measurement-based quantum computation DE Browne, E Kashefi, M Mhalla, S Perdrix New Journal of Physics 9 (8), 250, 2007 | 121 | 2007 |

Communication through coherent control of quantum channels AA Abbott, J Wechs, D Horsman, M Mhalla, C Branciard Quantum 4, 333, 2020 | 50 | 2020 |

Finding optimal flows efficiently M Mhalla, S Perdrix International Colloquium on Automata, Languages, and Programming, 857-868, 2008 | 45 | 2008 |

Graph states, pivot minor, and universality of (X, Z)-measurements M Mhalla, S Perdrix arXiv preprint arXiv:1202.6551, 2012 | 25 | 2012 |

Information flow in secret sharing protocols E Kashefi, D Markham, M Mhalla, S Perdrix arXiv preprint arXiv:0909.4479, 2009 | 24 | 2009 |

Which graph states are useful for quantum information processing? M Mhalla, M Murao, S Perdrix, M Someya, PS Turner Conference on Quantum Computation, Communication, and Cryptography, 174-187, 2011 | 21 | 2011 |

Resources required for preparing graph states P Høyer, M Mhalla, S Perdrix International Symposium on Algorithms and Computation, 638-649, 2006 | 19 | 2006 |

On a modular domination game S Gravier, M Mhalla, E Tannier Theoretical Computer Science 306 (1-3), 291-303, 2003 | 19 | 2003 |

New protocols and lower bounds for quantum secret sharing with graph states J Javelle, M Mhalla, S Perdrix Conference on Quantum Computation, Communication, and Cryptography, 1-12, 2012 | 18 | 2012 |

Rainbow and orthogonal paths in factorizations of *K*_{n}A Gyarfas, M Mhalla Journal of Combinatorial Designs 18 (3), 167-176, 2010 | 17 | 2010 |

Complexity of graph state preparation M Mhalla, S Perdrix arXiv preprint quant-ph/0412071, 2004 | 12 | 2004 |

On weak odd domination and graph-based quantum secret sharing S Gravier, J Javelle, M Mhalla, S Perdrix Theoretical Computer Science 598, 129-137, 2015 | 11 | 2015 |

Separability of pure n-qubit states: two characterizations P Jorrand, M Mhalla International Journal of Foundations of Computer Science 14 (05), 797-814, 2003 | 10 | 2003 |

On the minimum degree up to local complementation: Bounds and complexity J Javelle, M Mhalla, S Perdrix International Workshop on Graph-Theoretic Concepts in Computer Science, 138-147, 2012 | 9 | 2012 |

Quantum query complexity of graph connectivity C Durr, M Mhalla, Y Lei arXiv preprint quant-ph/0303169, 2003 | 9 | 2003 |

Quantum secret sharing with graph states S Gravier, J Javelle, M Mhalla, S Perdrix International Doctoral Workshop on Mathematical and Engineering Methods in …, 2012 | 8 | 2012 |

Contextuality in multipartite pseudo-telepathy graph games A Anshu, P Høyer, M Mhalla, S Perdrix Journal of Computer and System Sciences 107, 156-165, 2020 | 6 | 2020 |

Pseudo-telepathy games and genuine NS k-way nonlocality using graph states A Anshu, M Mhalla arXiv preprint arXiv:1207.2276, 2012 | 6 | 2012 |

Toward quantum combinatorial games P Dorbec, M Mhalla arXiv preprint arXiv:1701.02193, 2017 | 4 | 2017 |