Monday, October 21, 2019 (all day) to Thursday, October 24, 2019 (all day)
Quantum Innovators logo

The Quantum Innovators in Computer Science and Mathematics workshop brings together promising researchers working on theoretical aspects of quantum information and computation in computer science and mathematics. 

Talks are open for anyone to attend.

Wednesday, November 20, 2019 — 2:00 PM EST

Seminar featuring Bhaskaran Muralidharan, Indian Institute of Technology Bombay

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

Pavel Lougovski, Oak Ridge National Laboratory

Wednesday, November 13, 2019 — 2:30 PM EST

Jesse Stryker, The University of Washington

Results from the first digital quantum simulation of an SU(2) gauge theory are presented. This was done by analytically constructing gauge-invariant states and implementing a Trotterized time evolution operator for that basis on superconducting hardware. By using error mitigation techniques, electric energy measurements could be reliably extracted following one Trotter-Suzuki time step. This work is a small but important step toward determining what field-theoretic calculations will be possible using near-term devices.

Tuesday, November 12, 2019 — 9:30 AM EST

Seminar featuring Ghulam Dastgeer, Sejong University

Wednesday, November 6, 2019 — 2:30 PM EST

Seminar featuring Vikesh Siddhu

A long standing issue in quantum information theory is to understand the quantum capacity. One main reason for our lack of understanding is the non-additivity of the one-shot quantum capacity. Another reason is the absence of clarity about noisy quantum channels that have positive quantum capacity.

Tuesday, November 5, 2019 — 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:

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

John Nichol, University of Rochester

Monday, October 28, 2019 — 2:30 PM EDT

Fabio Cicoira, Department of Chemical Engineering, Polytechnique Montréal, Canada

Friday, October 25, 2019 (all day)

The one-day workshop is the third in a series that brings together researchers at Institut de Recherche en Informatique Fondamentale (IRIF), Université Paris-Diderot and the Institute for Quantum Computing, University of Waterloo. It will feature a full day of talks on recent progress in quantum algorithms and complexity theory, and related areas, made by members of the two institutions, with the idea to foster collaboration.

S M T W T F S
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
  1. 2020 (2)
    1. August (1)
    2. June (1)
    3. May (1)
  2. 2019 (136)
    1. December (3)
    2. November (10)
    3. October (7)
    4. September (5)
    5. August (10)
    6. July (17)
    7. June (13)
    8. May (15)
    9. April (15)
    10. March (11)
    11. February (20)
    12. January (12)
  3. 2018 (147)
    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 (12)
  4. 2017 (135)
  5. 2016 (94)
  6. 2015 (85)
  7. 2014 (96)
  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)

Educational programs

QKD - Quantum Key Distribution Summer School

USEQIP - Undergraduate School on Experimental Quantum Information Processing

QCSYS - Quantum Cryptography School for Young Students

Quantum Innovators logo

Schrödinger's Class button