REVIEW 1 cited by
The one-way communication complexity of the Boolean Hidden Matching Problem
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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].
Forward citations
Cited by 1 Pith paper
-
Quantum Coordination Advantages in AI State-Tracking Tasks: Semantic Compilation and Latent Memory
A boundary-preserving semantic-compilation theorem converts known one-way, streaming, and contextuality separations into architecture-independent coordination-width lower bounds for AI state-tracking solvers, with thr...
Discussion (0). Continue with ORCID to comment.