par Degorre, Julien;Kaplan, Marc;Laplante, Sophie;Roland, Jérémie 
Référence 34th International Symposium on Mathematical Foundations of Computer Science (MFCS'09), Springer, Vol. 5734, page (270-281)
Publication Publié, 2009
Référence 34th International Symposium on Mathematical Foundations of Computer Science (MFCS'09), Springer, Vol. 5734, page (270-281)
Publication Publié, 2009
Publication dans des actes
| Résumé : | We study a model of communication complexity that encompasses many well-studied problems, including classical and quantum communication complexity, the complexity of simulating distributions arising from bipartite mea- surements of shared quantum states, and XOR games. In this model, Alice gets an input x, Bob gets an input y, and their goal is to each produce an output a, b distributed according to some pre-speciï¬ed joint distribution p(a, b |
