Tuesday, November 5, 2019

Tuesday, November 5, 2019 — 11:00 to 11:00 AM EST

Narayanan Rengaswamy, Duke University

In order to perform universal fault-tolerant quantum computation, one needs to implement a logical non-Clifford gate. Consequently, it is important to understand codes that implement such gates transversally. In this paper, we adopt an algebraic approach to characterize all stabilizer codes for which transversal T and T^{-1} gates preserve the codespace. Our Heisenberg perspective reduces this question to a finite geometry problem that translates to the design of certain classical codes. We prove three corollaries of this result:

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 (134)
    1. December (3)
    2. November (7)
    3. October (7)
    4. September (5)
    5. August (10)
    6. July (17)
    7. June (14)
    8. May (15)
    9. April (15)
    10. March (11)
    11. February (20)
    12. January (12)
  3. 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)
  4. 2017 (135)
  5. 2016 (94)
  6. 2015 (85)
  7. 2014 (97)
  8. 2013 (92)
  9. 2012 (125)
  10. 2011 (117)
  11. 2010 (41)
  12. 2009 (4)
  13. 2008 (1)
  14. 2007 (1)
  15. 2005 (1)
  16. 2004 (3)