Reproduce “Information Complexity of Inner Product and Matrix Multiplication via Shannon-to-Min-Entropy Conversion” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Xiaohong Cai, Mingyang Zhu
The authors determine how much information Alice and Bob must reveal to compute the binary inner product of independent uniform m-bit vectors when Bob’s average error is at most ε. An exact-or-guess protocol uses (1−2ε)m bits of information. They prove every protocol requires at least max{(1−2ε)m−c₀,0}, where c₀<4.772; at zero error, cost is exactly m.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.