Monday, November 25, 2019

Monday, November 25, 2019 — 12:00 to 12:00 PM EST

Tomoyuki Morimae, Kyoto University

It is known that several sub-universal quantum computing models, such as the IQP model, Boson sampling model, and the one-clean qubit model, cannot be classically simulated unless the polynomial-time hierarchy collapses. However, these results exclude only polynomial-time classical simulations. In this talk, based on fine-grained complexity conjectures, I show more ``fine-grained" quantum supremacy results that prohibit certain exponential-time classical simulations. (Morimae and Tamaki, arXiv:1901.01637)

Monday, November 25, 2019 — 2:30 PM EST

Mete Atature, The University of Cambridge

S M T W T F S
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. 2020 (2)
    1. August (1)
    2. June (1)
    3. May (1)
  2. 2019 (138)
    1. December (6)
    2. November (10)
    3. October (7)
    4. September (5)
    5. August (10)
    6. July (16)
    7. June (13)
    8. May (15)
    9. April (15)
    10. March (11)
    11. February (20)
    12. January (12)
  3. 2018 (144)
    1. December (8)
    2. November (19)
    3. October (10)
    4. September (10)
    5. August (9)
    6. July (11)
    7. June (9)
    8. May (13)
    9. April (16)
    10. March (16)
    11. February (14)
    12. January (12)
  4. 2017 (134)
  5. 2016 (92)
  6. 2015 (84)
  7. 2014 (94)
  8. 2013 (91)
  9. 2012 (123)
  10. 2011 (117)
  11. 2010 (41)
  12. 2009 (4)
  13. 2008 (1)
  14. 2007 (1)
  15. 2005 (1)
  16. 2004 (3)