The one-way communication complexity of the Boolean Hidden Matching Problem
Quantum Physics
2007-05-23 v1 Computational Complexity
Abstract
We give a tight lower bound of Omega(\sqrt{n}) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communication complexity protocol of O(\log n) qubits for this problem, we obtain an exponential separation of quantum and classical one-way communication complexity for partial functions. A similar result was independently obtained by Gavinsky, Kempe, de Wolf [GKdW06]. Our lower bound is obtained by Fourier analysis, using the Fourier coefficients inequality of Kahn Kalai and Linial [KKL88].
Cite
@article{arxiv.quant-ph/0607173,
title = {The one-way communication complexity of the Boolean Hidden Matching Problem},
author = {Iordanis Kerenidis and Ran Raz},
journal= {arXiv preprint arXiv:quant-ph/0607173},
year = {2007}
}