mehdi mhalla
mehdi mhalla
Verified email at imag.fr
Title
Cited by
Cited by
Year
Quantum query complexity of some graph problems
C Drr, M Heiligman, P HOyer, M Mhalla
SIAM Journal on Computing 35 (6), 1310-1328, 2006
1752006
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
1072007
Finding optimal flows efficiently
M Mhalla, S Perdrix
International Colloquium on Automata, Languages, and Programming, 857-868, 2008
392008
Information flow in secret sharing protocols
E Kashefi, D Markham, M Mhalla, S Perdrix
arXiv preprint arXiv:0909.4479, 2009
242009
Graph states, pivot minor, and universality of (x, z)-measurements
M Mhalla, S Perdrix
arXiv preprint arXiv:1202.6551, 2012
232012
Communication through coherent control of quantum channels
AA Abbott, J Wechs, D Horsman, M Mhalla, C Branciard
arXiv preprint arXiv:1810.09826, 2018
202018
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
182011
Resources required for preparing graph states
P Hyer, M Mhalla, S Perdrix
International Symposium on Algorithms and Computation, 638-649, 2006
182006
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
172012
On a modular domination game
S Gravier, M Mhalla, E Tannier
Theoretical Computer Science 306 (1-3), 291-303, 2003
172003
Rainbow and orthogonal paths in factorizations of Kn
A Gyarfas, M Mhalla
Journal of Combinatorial Designs 18 (3), 167-176, 2010
162010
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
122015
Complexity of graph state preparation
M Mhalla, S Perdrix
arXiv preprint quant-ph/0412071, 2004
112004
Separability of pure n-qubit states: two characterizations
P Jorrand, M Mhalla
International Journal of Foundations of Computer Science 14 (05), 797-814, 2003
102003
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
92012
Quantum query complexity of graph connectivity
C Durr, M Mhalla, Y Lei
arXiv preprint quant-ph/0303169, 2003
92003
Quantum secret sharing with graph states
S Gravier, J Javelle, M Mhalla, S Perdrix
International Doctoral Workshop on Mathematical and Engineering Methods in…, 2012
82012
Pseudo-telepathy games and genuine NS k-way nonlocality using graph states
A Anshu, M Mhalla
arXiv preprint arXiv:1207.2276, 2012
52012
Classical versus quantum graph-based secret sharing
J Javelle, M Mhalla, S Perdrix
arXiv preprint arXiv:1109.4731, 2011
52011
Combinatorial graph games
E Duchene, S Gravier, M Mhalla
Ars Combin 90, 33-44, 2009
42009
The system can't perform the operation now. Try again later.
Articles 1–20