Monday, December 5, 2016

Monday, December 5, 2016 — 11:45 to 11:45 AM EST

Exponential Separation between Quantum Communication Complexity and Classical Information Complexity

Dave Touchette, IQC

We exhibit a Boolean function for which the quantum communication complexity is exponentially larger than the classical information complexity. An exponential separation in the other direction was already known from the work of Kerenidis et. al. [SICOMP 44, pp. 1550--1572], hence our work implies that these two complexity measures are incomparable. As classical information complexity is an upper bound on quantum information complexity, which in turn is equal to amortized quantum communication complexity, our work implies that a tight direct sum result for distributional quantum communication complexity cannot hold.

S M T W T F S
27
28
29
30
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
  1. 2021 (36)
    1. August (5)
    2. July (4)
    3. June (5)
    4. May (3)
    5. April (4)
    6. March (5)
    7. February (4)
    8. January (6)
  2. 2020 (31)
    1. December (2)
    2. November (5)
    3. October (4)
    4. September (3)
    5. August (2)
    6. June (4)
    7. April (1)
    8. March (3)
    9. February (5)
    10. January (2)
  3. 2019 (139)
  4. 2018 (142)
  5. 2017 (131)
  6. 2016 (88)
    1. December (9)
    2. November (15)
    3. October (12)
    4. September (9)
    5. August (11)
    6. July (5)
    7. June (6)
    8. May (3)
    9. April (4)
    10. March (6)
    11. February (5)
    12. January (4)
  7. 2015 (82)
  8. 2014 (94)
  9. 2013 (91)
  10. 2012 (122)
  11. 2011 (117)
  12. 2010 (41)
  13. 2009 (4)
  14. 2008 (1)
  15. 2005 (1)
  16. 2004 (3)