#### Filter Results:

- Full text PDF available (18)

#### Publication Year

2003

2018

- This year (1)
- Last 5 years (10)
- Last 10 years (19)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Christoph DÃ¼rr, Mark Heiligman, Peter HÃ¸yer, Mehdi Mhalla
- ICALP
- 2004

Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded errorâ€¦ (More)

- Mehdi Mhalla, Simon Perdrix
- ICALP
- 2008

Among the models of quantum computation, the One-way Quantum Computer [10, 11] is one of the most promising proposals of physical realization [12], and opens new perspectives for parallelization byâ€¦ (More)

- Philippe Jorrand, Mehdi Mhalla
- Int. J. Found. Comput. Sci.
- 2003

Most major results in quantum information processing and communication do rely upon quantum entanglement as their key ingredient: quantum dense coding [1] and teleportation [2], quantum algorithmsâ€¦ (More)

For n even, a factorization of a complete graph Kn is a partition of the edges into nâˆ’1 perfect matchings, called the factors of the factorization. With respect to a factorization, a path is calledâ€¦ (More)

- JÃ©rÃ´me Javelle, Mehdi Mhalla, Simon Perdrix
- TQC
- 2012

- Sylvain Gravier, JÃ©rÃ´me Javelle, Mehdi Mhalla, Simon Perdrix
- MEMICS
- 2012

We study the graph-state-based quantum secret sharing protocols [24, 17] which are not only very promising in terms of physical implementation, but also resource efficient since every playerâ€™s shareâ€¦ (More)

This work presents new interesting results in both areas of graph theory and quantum computation. It analyzes the complexity of preparation of some quantum states called graph states, andâ€¦ (More)

- Sylvain Gravier, JÃ©rÃ´me Javelle, Mehdi Mhalla, Simon Perdrix
- Theor. Comput. Sci.
- 2015

A weak odd dominated (WOD) set in a graph is a subset B of vertices for which there exists a distinct set of vertices C such that every vertex in B has an odd number of neighbors in C. We point outâ€¦ (More)

The local minimum degree of a graph is the minimum degree reached by means of a series of local complementations. In this paper, we investigate on this quantity which plays an important role inâ€¦ (More)

- Sylvain Gravier, Mehdi Mhalla, Eric Tannier
- Theor. Comput. Sci.
- 2003

We present a generalization of the so-called Ïƒ-game, introduced by Sutner [9], a combinatorial game played on a graph, with relations to cellular automata, as well as odd domination in graphs. Aâ€¦ (More)