Small to medium scale quantum computers are around the corner, and the biggest upcoming challenges are expected to be algorithmic. What computational tasks can such computers speed up? And how can we test them? More specifically, what are the prospects for quantum simulation, quantum machine learning, and protocols for testing quantum devices? The answers to these questions touch on deep issues and will require an unprecedented collaboration between theoretical computer science (algorithms, complexity theory, cryptography) and physics, chemistry and mathematics. This summer cluster will bring together researchers from these fields to collaborate on formalizing and answering these questions. The third week of the 8-week program, June 11-15, will be devoted to a workshop exploring the state of the art related to these challenges.
Long-Term Participants (tentative list, including organizers): Dorit Aaronov (Hebrew University), Scott Aaronson (UT Austin), Dominic Berry (Macquarie University), Fernando Brandao (Caltech), Anne Broadbent (University of Ottawa), Andrew Childs (University of Maryland), Ignacio Cirac (MPQ), Ronald de Wolf (QuSoft, CWI and University of Amsterdam), Joe Fitzsimmons (Singapore University of Technology and Design), Steve Flammia (University of Sydney), Daniel Gottesman (Perimeter Institute), Patrick Hayden (Stanford), Richard Josza (Cambridge), Elham Kashefi (University of Edinburgh), Iordanis Kerenidis (LIRIF), Robin Kothari (Microsoft Research), Ben Reichardt (USC), Yaoyun Shi (Alibaba USA), Mario Szegedy (Rutgers), Umesh Vazirani (UC Berkeley), Frank Verstraete (University of Ghent), Thomas Vidick (Caltech), Mark Zhandry (Princeton).