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 条
[31]   Quantum communication and complexity [J].
de Wolf, R .
THEORETICAL COMPUTER SCIENCE, 2002, 287 (01) :337-353
[32]   Quantum communication complexity [J].
Brassard, G .
FOUNDATIONS OF PHYSICS, 2003, 33 (11) :1593-1616
[33]   Quantum Communication Complexity [J].
Gilles Brassard .
Foundations of Physics, 2003, 33 :1593-1616
[34]   Entangled Simultaneity Versus Classical Interactivity in Communication Complexity [J].
Gavinsky, Dmitry .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (07) :4641-4651
[35]   The Existence of Distinguishable Bases in Three-Dimensional Subspaces of Qutrit-Qudit Systems Under One-Way Local Projective Measurements and Classical Communication [J].
Song, Zhiwei ;
Chen, Lin ;
Dokovi, Dragomir Z. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (12) :8806-8815
[36]   Complexity and Capacity Bounds for Quantum Channels [J].
Levene, Rupert H. ;
Paulsen, Vern I. ;
Todorov, Ivan G. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (10) :6917-6928
[37]   The Partition Bound for Classical Communication Complexity and Query Complexity [J].
Jain, Rahul ;
Klauck, Hartmut .
25TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY - CCC 2010, 2010, :247-258
[38]   Experimental multipartner quantum communication complexity employing just one qubit [J].
Pavel Trojek ;
Christian Schmid ;
Mohamed Bourennane ;
Časlav Brukner ;
Marek Żukowski ;
Harald Weinfurter .
Natural Computing, 2013, 12 :19-26
[39]   Experimental multipartner quantum communication complexity employing just one qubit [J].
Trojek, Pavel ;
Schmid, Christian ;
Bourennane, Mohamed ;
Brukner, Caslav ;
Zukowski, Marek ;
Weinfurter, Harald .
NATURAL COMPUTING, 2013, 12 (01) :19-26
[40]   Degradable states and one-way entanglement distillation [J].
Leditzky, Felix ;
Datta, Nilanjana ;
Smit, Graeme .
2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, :1559-1562