11 citations · 18 across the 4 of their papers we have counts for
Showing 2003Show all
2 papers · 1 filter
quant-ph2003
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…
quant-ph2003★ 7 cited
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…