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 条
  • [41] ONE-WAY FUNCTIONS AND CIRCUIT COMPLEXITY
    BOPPANA, RB
    LAGARIAS, JC
    INFORMATION AND COMPUTATION, 1987, 74 (03) : 226 - 240
  • [42] On One-way Functions and Kolmogorov Complexity
    Liu, Yanyi
    Pass, Rafael
    2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 1243 - 1254
  • [43] On quantum one-way permutations
    Kashefi, E
    Nishimura, H
    Vedral, V
    QUANTUM INFORMATION & COMPUTATION, 2002, 2 (05) : 379 - 398
  • [44] One-way quantum computer
    Noriaki Horiuchi
    Nature Photonics, 2015, 9 (1) : 7 - 7
  • [45] On quantum one-way permutations
    Kashefi, Elham
    Nishimura, Harumichi
    Vedral, Vlatko
    Quantum Information and Computation, 2002, 2 (05): : 379 - 398
  • [46] A one-way quantum computer
    Raussendorf, R
    Briegel, HJ
    PHYSICAL REVIEW LETTERS, 2001, 86 (22) : 5188 - 5191
  • [47] One-way quantum computer
    Horiuchi, Noriaki
    NATURE PHOTONICS, 2015, 9 (01) : 7 - 7
  • [48] One-shot assisted distillation of coherence via one-way local quantum-incoherent operations and classical communication
    Zhang, Shuyi
    Luo, Yu
    Shao, Lian-He
    Xi, Zhengjun
    Fan, Heng
    PHYSICAL REVIEW A, 2020, 102 (05)
  • [49] On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
    Hromkovic, J
    Schnitger, G
    INFORMATION AND COMPUTATION, 2001, 169 (02) : 284 - 296
  • [50] Distinguishing maximally entangled states by one-way local operations and classical communication
    Zhang, Zhi-Chao
    Feng, Ke-Qin
    Gao, Fei
    Wen, Qiao-Yan
    PHYSICAL REVIEW A, 2015, 91 (01):