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 条
  • [1] A NEW EXPONENTIAL SEPARATION BETWEEN QUANTUM AND CLASSICAL ONE-WAY COMMUNICATION COMPLEXITY
    Montanaro, Ashley
    [J]. QUANTUM INFORMATION & COMPUTATION, 2011, 11 (7-8) : 574 - 591
  • [2] Exponential separation of quantum and classical one-way communication complexity
    Bar-Yossef, Ziv
    Jayram, T. S.
    Kerenidis, Iordanis
    [J]. SIAM JOURNAL ON COMPUTING, 2008, 38 (01) : 366 - 384
  • [3] Unbounded-error one-way classical and quantum communication complexity
    Iwama, Kazuo
    Nishimura, Harumichi
    Raymond, Rudy
    Yamashita, Shigeru
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 110 - +
  • [4] On relating one-way classical and quantum communication complexities
    Boddu, Naresh Goud
    Jain, Rahul
    Lin, Han-Hsuan
    [J]. QUANTUM, 2023, 7
  • [5] Lower bounds for one-way probabilistic communication complexity and their application to space complexity
    Ablayev, F
    [J]. THEORETICAL COMPUTER SCIENCE, 1996, 157 (02) : 139 - 159
  • [6] Quantum One-Way Communication can be Exponentially Stronger Than Classical Communication
    Klartag, Bo'az
    Regev, Oded
    [J]. STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING, 2011, : 31 - 40
  • [7] On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
    Zhang, Shengyu
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT I, 2011, 6755 : 49 - 60
  • [8] Exponential Separations for One-Way Quantum Communication Complexity, with Applications to Cryptography
    Gavinsky, Dmitry
    Kempe, Julia
    Kerenidis, Iordanis
    Raz, Ran
    de Wolf, Ronald
    [J]. STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 516 - 525
  • [9] EXPONENTIAL SEPARATION FOR ONE-WAY QUANTUM COMMUNICATION COMPLEXITY, WITH APPLICATIONS TO CRYPTOGRAPHY
    Gavinsky, Dmitry
    Kempe, Julia
    Kerenidis, Iordanis
    Raz, Ran
    De Wolf, Ronald
    [J]. SIAM JOURNAL ON COMPUTING, 2008, 38 (05) : 1695 - 1708
  • [10] Quantum one-way versus classical two-way communication in XOR games
    Abderramán Amr
    Ignacio Villanueva
    [J]. Quantum Information Processing, 2021, 20