A NEW EXPONENTIAL SEPARATION BETWEEN QUANTUM AND CLASSICAL ONE-WAY COMMUNICATION COMPLEXITY

被引：0
|
作者：
Montanaro, Ashley [1 ]
机构：
[1] Univ Cambridge, Dept Appl Math & Theoret Phys, Ctr Quantum Informat & Fdn, Cambridge CB3 9EW, England
来源：
QUANTUM INFORMATION & COMPUTATION | 2011年 / 11卷 / 7-8期
基金：
英国工程与自然科学研究理事会;
关键词：
Quantum communication complexity; subgroup membership; Fourier analysis; FOURIER-ANALYSIS; CODES;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. The problem is a natural generalisation of the previously studied Subgroup Membership problem: Alice receives a bit string x, Bob receives a permutation matrix M, and their task is to determine whether Mx = x or Mx is far from x. The proof uses Fourier analysis and an inequality of Kahn, Kalai and Linial.
引用
收藏
页码：574 / 591
页数：18
相关论文
共 50 条
  • [1] 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
  • [2] 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
  • [3] New bounds on classical and quantum one-way communication complexity
    Jain, Rahul
    Zhang, Shengyu
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (26) : 2463 - 2477
  • [4] 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
  • [5] 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 - +
  • [6] On relating one-way classical and quantum communication complexities
    Boddu, Naresh Goud
    Jain, Rahul
    Lin, Han-Hsuan
    [J]. QUANTUM, 2023, 7
  • [7] 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
  • [8] 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
  • [9] Quantum one-way versus classical two-way communication in XOR games
    Abderramán Amr
    Ignacio Villanueva
    [J]. Quantum Information Processing, 2021, 20
  • [10] Quantum one-way versus classical two-way communication in XOR games
    Amr, Abderraman
    Villanueva, Ignacio
    [J]. QUANTUM INFORMATION PROCESSING, 2021, 20 (02)
12345