Tuesday, April 23, 2019 — 2:00 PM EDT

Anand Natarajan, Caltech

A long-standing puzzle in quantum complexity theory is to understand the power of the class MIP* of multiprover interactive proofs with shared entanglement. This question is closely related to the study of entanglement through non-local games, which dates back to the pioneering work of Bell. In this work we show that MIP* contains NEEXP (non-deterministic doubly exponential time), exponentially improving the prior lower bound of NEXP due to Ito and Vidick. Our result shows that shared entanglement exponentially increases the power of these proof systems, as the class MIP of multiprover interactive proofs without shared entanglement is known to be equal to NEXP.

Joint work with John Wright (MIT)

NB Change of venue: this seminar will now take place in QNC 1501.

Location 
QNC - Quantum Nano Centre
1501
200 University Avenue West

Waterloo, ON N2L 3G1
Canada

S M T W T F S
26
27
28
29
30
31
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
1
2
3
4
5
6
  1. 2019 (93)
    1. November (1)
    2. August (3)
    3. July (4)
    4. June (13)
    5. May (15)
    6. April (15)
    7. March (11)
    8. February (20)
    9. January (12)
  2. 2018 (148)
    1. December (8)
    2. November (20)
    3. October (10)
    4. September (10)
    5. August (10)
    6. July (11)
    7. June (9)
    8. May (13)
    9. April (16)
    10. March (17)
    11. February (14)
    12. January (13)
  3. 2017 (135)
  4. 2016 (94)
  5. 2015 (85)
  6. 2014 (97)
  7. 2013 (92)
  8. 2012 (125)
  9. 2011 (117)
  10. 2010 (41)
  11. 2009 (4)
  12. 2008 (1)
  13. 2007 (1)
  14. 2005 (1)
  15. 2004 (3)