DeepAI AI Chat
Log In Sign Up

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

02/21/2023
∙
by   Srinivasan Arunachalam, et al.
∙
National University of Singapore
∙
ibm
∙
0
∙

We present a linear program for the one-way version of the partition bound (denoted 𝗉𝗋𝗍^1_ε(f)). We show that it characterizes one-way randomized communication complexity 𝖱_ε^1(f) with shared randomness of every partial function f:𝒳×𝒴→𝒵, i.e., for δ,ε∈(0,1/2), 𝖱_ε^1(f) ≥log𝗉𝗋𝗍_ε^1(f) and 𝖱_ε+δ^1(f) ≤log𝗉𝗋𝗍_ε^1(f) + loglog(1/δ). This improves upon the characterization of 𝖱_ε^1(f) in terms of the rectangle bound (due to Jain and Klauck, 2010) by reducing the additive O(log(1/δ))-term to loglog(1/δ).

READ FULL TEXT

page 1

page 2

page 3

page 4

∙ 07/24/2021

On relating one-way classical and quantum communication complexities

Let f: X × Y →{0,1,} be a partial function and μ be a distribution with ...
∙ 11/25/2018

Exponential Separation between Quantum Communication and Logarithm of Approximate Rank

Chattopadhyay, Mande and Sherif (ECCC 2018) recently exhibited a total B...
∙ 09/06/2020

Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture

We give improved separations for the query complexity analogue of the lo...
∙ 01/27/2021

Prefix-free quantum Kolmogorov complexity

We introduce quantum-K (QK), a measure of the descriptive complexity of ...
∙ 03/24/2022

Improved Communication Complexity of Fault-Tolerant Consensus

Consensus is one of the most thoroughly studied problems in distributed ...
∙ 09/23/2019

Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead

Buhrman, Cleve and Wigderson (STOC'98) observed that for every Boolean f...