New bounds on classical and quantum one-way communication complexity

被引:5
作者
Jain, Rahul [1 ,2 ]
Zhang, Shengyu [3 ]
机构
[1] Natl Univ Singapore, Sch Comp Sci, Singapore 119077, Singapore
[2] Natl Univ Singapore, Ctr Quantum Technol, Singapore 119077, Singapore
[3] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Shatin, Hong Kong, Peoples R China
基金
美国国家科学基金会;
关键词
Communication complexity; Information theory; Quantum; Rectangle bound; LEARNABILITY;
D O I
10.1016/j.tcs.2008.10.014
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical one-way model, our bound extends the well known upper bound of Kremer, Nisan and Ron [I. Kremer, N. Nisan, D. Ron, On randomized one-round communication complexity, in: Proceedings of The 27th ACM Symposium on Theory of Computing, STOC, 1995, pp. 596-605] to include non-product distributions. Let epsilon is an element of (0, 1/2) be a constant. We show that for a boolean function f : x x y -> {0, 1} and a non-product distribution mu on x x y, D-epsilon(1,mu)(f) = O((I(X:Y) + 1). VC(f)). where D-epsilon(1,mu)(f) represents the one-way distributional communication complexity off with error at most epsilon under mu; VC(f) represents the Vapnik-Chervonenkis dimension of f and I(X : Y) represents the mutual information, under mu, between the random inputs of the two parties. For a non-Boolean function f : x x y ->{1.....k}(k >= 2 an integer), we show a similar upper bound on D-epsilon(1,mu)(f) in terms of k, I(X : Y) and the pseudo-dimension off'=(def) f/k, a generalization of the VC-dimension for non-boolean functions. In the quantum one-way model we provide a lower bound on the distributional communication complexity, under product distributions, of a function f, in terms of the well studied complexity measure off referred to as the rectangle bound or the corruption bound of f. We show for a non-boolean total function f : x x y -> Z and a product distribution is mu on x x y, Q(epsilon 3/8)(1,mu)(f) = Omega(rec(epsilon)(1,mu)(f)). where Q(epsilon 3/8)(1,mu)(f) represents the quantum one-way distributional communication complexityof f with error at most epsilon(3/8) under mu and rec(epsilon)(1,mu) (f) represents the one-way rectangle bound off with error at most E under It. Similarly for a non-Boolean partial function f : x x y -> Z boolean OR {*} and a product distribution mu on x x y, we show. Q(epsilon 6/(2.154))/(1,mu) (f) = Omega (rec(epsilon)(1,mu)(f)). (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:2463 / 2477
页数:15
相关论文
共 50 条
[21]   Quantum and Classical Communication Complexity of Permutation-Invariant Functions [J].
Guan, Ziyi ;
Huang, Yunqi ;
Yao, Penghui ;
Ye, Zekun .
41ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, STACS 2024, 2024, 289
[22]   Bare Quantum Simultaneity Versus Classical Interactivity in Communication Complexity [J].
Gavinsky, Dmitry .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (10) :6583-6605
[23]   Quantum and Classical Communication Complexity of Permutation-Invariant Functions [J].
Guan, Ziyi ;
Huang, Yunqi ;
Yao, Penghui ;
Ye, Zekun .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2025, 71 (04) :2782-2799
[24]   Tensor norms and the classical communication complexity of nonlocal quantum measurement [J].
Shi, Yaoyun ;
Zhu, Yufan .
SIAM JOURNAL ON COMPUTING, 2008, 38 (03) :753-766
[25]   Generation of One-Way Gaussian Steering by Gaussian Channel and Converting One-Way Gaussian Steering by Beamsplitters [J].
Wang, Zhong-Xiao ;
Gao, Yong-Pan ;
Wang, Tie-Jun ;
Wang, Chuan .
ANNALEN DER PHYSIK, 2018, 530 (03)
[26]   Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems [J].
Ambainis, Andris ;
Gasarch, William ;
Srinivasan, Aravind ;
Utis, Andrey .
ACM TRANSACTIONS ON COMPUTATION THEORY, 2015, 7 (03)
[27]   Secret-Key Generation Using Compound Sources and One-Way Public Communication [J].
Tavangaran, Nima ;
Boche, Holger ;
Schaefer, Rafael F. .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2017, 12 (01) :227-241
[28]   Unidirectional Gaussian One-Way Steering [J].
El Qars, Jamal .
ANNALEN DER PHYSIK, 2022, 534 (06)
[29]   Some improved bounds on communication complexity via new decomposition of cliques [J].
Amano, Kazuyuki .
DISCRETE APPLIED MATHEMATICS, 2014, 166 :249-254
[30]   Classical lower bounds from quantum upper bounds [J].
Ben-David, Shalev ;
Bouland, Adam ;
Garg, Ankit ;
Kothari, Robin .
2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2018, :339-349