108 citations · 356 across the 14 of their papers we have counts for
16 papers
Certification complexity of Boolean functions
Chandrima Kayal, Sophie Laplante, Émile Larroque +2
Certificate complexity is a fundamental measure of complexity of Boolean functions f which counts the number of bits of an input that need to be known in order for the va…
The communication complexity of functions with large outputs
Lila Fontes, Sophie Laplante, Mathieu Lauriere +1
We study the two-party communication complexity of functions with large outputs, and show that the communication complexity can greatly vary depending on what output model is consi…
QuBOBS, interactive objects and a visual representation to explain quantum computing
Sophie Laplante, Loris Perez, Sylvie Tissot +1
We introduce a visual representation of qubits to assist in explaining quantum computing to a broad audience. The representation follows from physical devices that we developed to…
Certificate Games and Consequences for the Classical Adversary Bound
Sourav Chakraborty, Anna Gál, Mika Göös +3
We introduce and study Certificate Game complexity, a measure of complexity based on the probability of winning a game where two players are given inputs with different function va…
Provably secure key establishment against quantum adversaries
Aleksandrs Belovs, Gilles Brassard, Peter Hoyer +3
At Crypto 2011, some of us had proposed a family of cryptographic protocols for key establishment capable of protecting quantum and classical legitimate parties unconditionally aga…
Robust Bell inequalities from communication complexity
Sophie Laplante, Mathieu Laurière, Alexandre Nolin +2
The question of how large Bell inequality violations can be, for quantum distributions, has been the object of much work in the past several years. We say that a Bell inequality is…