53 citations · 63 across the 2 of their papers we have counts for
2 papers
cs.CC2012★ 53 cited
Lower bounds on information complexity via zero-communication protocols and applications
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays +2
We show that almost all known lower bound methods for communication complexity are also lower bounds for the information complexity. In particular, we define a relaxed version of t…
quant-ph2012★ 10 cited
Classical and quantum partition bound and detector inefficiency
S. Laplante, V. Lerays, J. Roland
We study randomized and quantum efficiency lower bounds in communication complexity. These arise from the study of zero-communication protocols in which players are allowed to abor…