Monday, February 5, 2018

Monday, February 5, 2018 — 9:30 AM EST

David Gosset, IBM TJ Watson Research Center

There is strong evidence that a sufficiently large fault-tolerant quantum computer would solve certain computational problems exponentially faster than any classical computer. How can quantum algorithms and complexity theory help guide the way forward in our current era of small and noisy quantum computers?

S M T W T F S
26
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
2
3
4
5
6
  1. 2021 (53)
    1. December (3)
    2. November (7)
    3. October (5)
    4. September (3)
    5. August (4)
    6. July (4)
    7. June (5)
    8. May (3)
    9. April (4)
    10. March (5)
    11. February (4)
    12. 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)
    1. December (8)
    2. November (19)
    3. October (9)
    4. September (10)
    5. August (8)
    6. July (11)
    7. June (9)
    8. May (13)
    9. April (16)
    10. March (16)
    11. February (14)
    12. January (12)
  5. 2017 (131)
  6. 2016 (88)
  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)