11 citations · 18 across the 4 of their papers we have counts for
5 papers
Complexity of Graph State Preparation
Mehdi Mhalla, Simon Perdrix
The graph state formalism is a useful abstraction of entanglement. It is used in some multipartite purification schemes and it adequately represents universal resources for measure…
Let us play with qubits
Sylvain Gravier, Philippe Jorrand, Mehdi Mhalla +1
Quantum game theory offers a lot of interesting questions, and it is relevant to use the quantum information theory to resolve or improve games with lack of information : how to us…
Quantum query complexity of graph connectivity
Christoph Durr, Mehdi Mhalla, Yaohui Lei
Harry Buhrman et al gave an Omega(sqrt n) lower bound for monotone graph properties in the adjacency matrix query model. Their proof is based on the polynomial method. However for…
Separability of pure n-qubit states: two characterizations
Philippe Jorrand, Mehdi Mhalla
This paper characterizes two forms of separability of pure states of systems of n qubits: (i) into a tensor product of n qubit states, and (ii), into a tensor product of 2 subsyste…
Quantum Period Query Proves NP in BQP
Philippe Jorrand, Mehdi Mhalla
Withdrawn by the authors. Since the elements within each period of function hA are not distinct, period finding cannot operate properly. Thanks to all for the comments and sorry fo…