DOI10.4230/LIPIcs.STACS.2013.424zbMath1354.68087arXiv1204.4619MaRDI QIDQ2957903
Hartmut Klauck, Ronald de Wolf
Publication date: 30 January 2017
Full work available at URL: https://arxiv.org/abs/1204.4619
zbMATH Keywords
lower bound; quantum computing; communication complexity; fooling set
Mathematics Subject Classification ID
68M12: Network protocols
68Q12: Quantum algorithms and complexity in the theory of computing