Faculty

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.

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?

Single-photon detectors for satellite-based quantum communications

Nigar Sultana

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.