| 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 | 268 | 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 | 159 | 2007 |
| Communication through coherent control of quantum channels AA Abbott, J Wechs, D Horsman, M Mhalla, C Branciard Quantum 4, 333, 2020 | 119 | 2020 |
| Finding optimal flows efficiently M Mhalla, S Perdrix International Colloquium on Automata, Languages, and Programming, 857-868, 2008 | 51 | 2008 |
| Which graph states are useful for quantum information processing? M Mhalla, M Murao, S Perdrix, M Someya, PS Turner Theory of Quantum Computation, Communication, and Cryptography: 6th …, 2014 | 31 | 2014 |
| Resources required for preparing graph states P Høyer, M Mhalla, S Perdrix Algorithms and Computation: 17th International Symposium, ISAAC 2006 …, 2006 | 29 | 2006 |
| Graph states, pivot minor, and universality of (X, Z)-measurements M Mhalla, S Perdrix arXiv preprint arXiv:1202.6551, 2012 | 28 | 2012 |
| Stabilizer inactivation for message-passing decoding of quantum LDPC codes J Du Crest, M Mhalla, V Savin 2022 IEEE Information Theory Workshop (ITW), 488-493, 2022 | 25 | 2022 |
| Information flow in secret sharing protocols E Kashefi, D Markham, M Mhalla, S Perdrix arXiv preprint arXiv:0909.4479, 2009 | 25 | 2009 |
| Rainbow and orthogonal paths in factorizations of Kn A Gyarfas, M Mhalla Journal of Combinatorial Designs 18 (3), 167-176, 2010 | 24 | 2010 |
| 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 | 21 | 2012 |
| On a modular domination game S Gravier, M Mhalla, E Tannier Theoretical Computer Science 306 (1-3), 291-303, 2003 | 19 | 2003 |
| 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 | 15 | 2015 |
| Complexity of graph state preparation M Mhalla, S Perdrix arXiv preprint quant-ph/0412071, 2004 | 13 | 2004 |
| Separability of pure n-qubit states: two characterizations P Jorrand, M Mhalla International Journal of Foundations of Computer Science 14 (05), 797-814, 2003 | 13 | 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 | 12 | 2012 |
| Coherent control and distinguishability of quantum channels via PBS-diagrams C Branciard, A Clément, M Mhalla, S Perdrix arXiv preprint arXiv:2103.02073, 2021 | 10 | 2021 |
| 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 | 9 | 2020 |
| Purely quantum polar codes F Dupuis, A Goswami, M Mhalla, V Savin 2019 IEEE Information Theory Workshop (ITW), 1-5, 2019 | 9 | 2019 |
| Quantum secret sharing with graph states S Gravier, J Javelle, M Mhalla, S Perdrix Mathematical and Engineering Methods in Computer Science: 8th International …, 2013 | 9 | 2013 |
