arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.10431cs.CC
收藏

关于单向经典通信复杂度的划分界的一个注记

A note on the partition bound for one-way classical communication complexity

IBM Quantum(IBM量子);HUN-REN Alfréd Rényi Institute of Mathematics(匈牙利科学院阿尔弗雷德·雷尼数学研究所);Centre for Quantum Technologies and Department of Computer Science, National University of Singapore(新加坡国立大学量子技术中心与计算机系)

Srinivasan Arunachalam, Joao F. Doriguello, Rahul Jain

AI总结:

本文提出单向划分界的线性规划刻画,证明其与单向随机通信复杂度在加性对数对数项内紧,改进了矩形界的结果。

摘要:

我们为Jain和Klauck的划分界的一个单向版本提出了一个线性规划,记为$\mathsf{prt}^1_\varepsilon(f)$,并证明它刻画了任意关系$f\subseteq\mathcal{X}\times\mathcal{Y}\times\mathcal{Z}$的具有共享随机性和最坏情况误差$\varepsilon$的单向随机通信复杂度$\mathsf{R}_\varepsilon^1(f)$。更精确地,对所有$\varepsilon,\delta\in(0,1/2)$,有$\mathsf{R}_\varepsilon^1(f) \geq \log\mathsf{prt}_\varepsilon^1(f)$和$\mathsf{R}_{\varepsilon+\delta}^1(f) \leq \lceil\log\mathsf{prt}_\varepsilon^1(f) + \log\log(1/\delta)\rceil$。这改进了Jain、Klauck和Nayak [STOC'08] 基于矩形界的$\mathsf{R}_\varepsilon^1(f)$刻画,该刻画仅在加法$O(\log(1/\delta))$项内紧。

英文摘要:

We present a linear program for a one-way version of the partition bound of Jain and Klauck, denoted $\mathsf{prt}^1_\varepsilon(f)$, and show that it characterizes the one-way randomized communication complexity $\mathsf{R}_\varepsilon^1(f)$ with shared randomness and worst-case error $\varepsilon$ of any relation $f\subseteq\mathcal{X}\times\mathcal{Y}\times\mathcal{Z}$. More precisely, for all $\varepsilon,δ\in(0,1/2)$, $\mathsf{R}_\varepsilon^1(f) \geq \log\mathsf{prt}_\varepsilon^1(f)$ and $\mathsf{R}_{\varepsilon+δ}^1(f) \leq \lceil\log\mathsf{prt}_\varepsilon^1(f) + \log\log(1/δ)\rceil$. This improves upon the characterization of $\mathsf{R}_\varepsilon^1(f)$ in terms of the rectangle bound due to Jain, Klauck, and Nayak [STOC'08], which is tight only up to an additive $O(\log(1/δ))$ term.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑