Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Monday, October 21, 2019 12:00 am - Thursday, October 24, 2019 12:00 am GMT (GMT +00:00)

Quantum Innovators in Computer Science and Mathematics

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.

Schedule button

Friday, October 25, 2019 12:00 am - 12:00 am EDT (GMT -04:00)

IQC-IRIF workshop on Quantum Algorithms and Complexity

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.

Tuesday, December 3, 2019 12:00 am - Wednesday, December 4, 2019 12:00 am GMT (GMT +00:00)

The IQC Workshop on Quantum Illumination: From Theory to Practice

The goal of the IQC Workshop on Quantum Illumination is to bring together a wide range of participants from these various domains to discuss the state of the art in laboratory research, the range of possible applications, and paths toward those applications.

Tuesday, January 28, 2020 2:30 pm - 2:30 pm EST (GMT -05:00)

New Insights About Quantum Approximate Counting

Special Colloquium Featuring Scott Aaronson University of Texas, Austin

Approximate counting -- given a black-box function f:[N]->{0,1}, multiplicatively estimate the number of x's such that f(x)=1 -- is one of the most basic problems in quantum algorithms. In 1998, Brassard, Hoyer, Mosca, and Tapp (BHMT) gave a fully quadratic quantum speedup for the problem, while Nayak and Wu showed that this speedup was optimal. What else is there to say?

Monday, February 3, 2020 2:30 pm - 2:30 pm EST (GMT -05:00)

Variational quantum algorithms: obstacles and opportunities

Colloquium featuring Sergey Bravyi IBM Research

Variational quantum algorithms such as VQE or QAOA aim to simulate low-energy properties of quantum many-body systems or find approximate solutions of combinatorial optimization problems. Such algorithms employ variational states generated by low-depth quantum circuits to minimize the expected value of a quantum or classical Hamiltonian.

Monday, June 29, 2020 2:30 pm - 2:30 pm EDT (GMT -04:00)

The Impossibility of Efficient Quantum Weak Coin-Flipping

Colloquium featuring Carl Alexander Miller - QuICS and NIST

How can two parties carry out a fair coin flip across a noiseless quantum channel? In 2007, Carlos Mochon proved a tantalizing result: he showed that fair quantum coin flipping is possible in principle, but he used a protocol that required a huge (exponential) number of communication rounds. In the twelve years since, despite some continued deep theoretical work on the problem, no improvements to the efficiency of Mochon's protocol have been made.

Tuesday, August 11, 2020 7:00 pm - 7:00 pm EDT (GMT -04:00)

IQC Fireside Chat with Raymond Laflamme

Raymond Laflamme

Join us for an intimate conversation featuring IQC researchers. Our first guest is Professor Raymond Laflamme, interviewed by John Donohue. John and Raymond will have a conversation about research, careers, and life in quantum information science, followed by Q&A from the audience. Tune in Tuesday August 11 at 7:00pm Eastern Time.